The capacitated orienteering problem

DOI10.1016/J.DAM.2014.10.001zbMATH Open1320.05065OpenAlexW2027505077MaRDI QIDQ496434FDOQ496434

Authors: Adrian Bock, Laura Sanità 

Publication date: 21 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.001

Recommendations

• Improved algorithms for orienteering and related problems
• Approximation algorithms for the arc orienteering problem
• The Euclidean Orienteering Problem Revisited
• The directed orienteering problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

zbMATH Keywords

approximation algorithmsorienteeringvehicle routing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Approximation algorithms (68W25) Paths and cycles (05C38)

Cites Work

• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• The orienteering problem
• The orienteering problem: a survey
• The team orienteering problem
• The capacitated team orienteering and profitable tour problems
• Title not available (Why is that?)
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• A TABU search heuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• Approximation algorithms for distance constrained vehicle routing problems
• A heuristic for the multiple tour maximum collection problem
• The split delivery capacitated team orienteering problem
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• New approaches to multi-objective optimization
• Title not available (Why is that?)
• Complexity and approximation for traveling salesman problems with profits
• The Euclidean Orienteering Problem Revisited
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

Cited In (10)

• The synchronized multi-assignment orienteering problem
• The hazardous orienteering problem
• The set orienteering problem
• The Euclidean Orienteering Problem Revisited
• Approximation algorithms for the arc orienteering problem
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• Algorithms for the thief orienteering problem on directed acyclic graphs
• Walking through waypoints
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• The capacitated team orienteering and profitable tour problems

This page was built for publication: The capacitated orienteering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496434)