The capacitated orienteering problem
type: Item
instance of: scholarly article
title: The capacitated orienteering problem
zbMATH Open document ID: 1320.05065
author: Adrian Bock
author: Laura Sanità
published in: Discrete Applied Mathematics
publication date: 2015-09-21T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6483957
zbMATH Keywords: orienteering
zbMATH Keywords: vehicle routing
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2014.10.001
OpenAlex ID: W2027505077
cites work: Complexity and approximation for traveling salesman problems with profits
cites work: The split delivery capacitated team orienteering problem
cites work: The capacitated team orienteering and profitable tour problems
cites work: Approximation algorithms for deadline-TSP and vehicle routing with time-windows
cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP
cites work: An exact algorithm for team orienteering problems
cites work: A heuristic for the multiple tour maximum collection problem
cites work: The team orienteering problem
cites work: Q3579451
cites work: The Euclidean Orienteering Problem Revisited
cites work: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
cites work: The orienteering problem
cites work: New approaches to multi-objective optimization
cites work: Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
cites work: Q4255028
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: Approximation algorithms for distance constrained vehicle routing problems
cites work: A TABU search heuristic for the team orienteering problem
cites work: The orienteering problem: a survey
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
DOI: 10.1016/J.DAM.2014.10.001
description: scientific article; zbMATH DE number 6483957