The set orienteering problem
type: Item
instance of: scholarly article
title: The set orienteering problem
zbMATH Open document ID: 1403.90197
author: C. Archetti
author: Francesco Carrabs
author: Raffaele Cerulli
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6876643
zbMATH Keywords: routing
zbMATH Keywords: orienteering problem
zbMATH Keywords: matheuristic
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.11.009
OpenAlex ID: W2775816300
cites work: The clustered orienteering problem
cites work: Q5271459
cites work: Vehicle Routing
cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
DOI: 10.1016/J.EJOR.2017.11.009
Recommended article: The orienteering problem
Recommended article: The directed orienteering problem
Recommended article: The orienteering problem: a survey
Recommended article: The probabilistic orienteering problem
Recommended article: The capacitated orienteering problem
Recommended article: The clustered orienteering problem
Recommended article: The team orienteering problem
Recommended article: The Euclidean Orienteering Problem Revisited
Recommended article: The multi-district team orienteering problem
description: scientific article; zbMATH DE number 6876643