Approximation algorithms for the arc orienteering problem

DOI10.1016/J.IPL.2014.10.003zbMath1302.68316OpenAlexW2052970971MaRDI QIDQ477675

Charalampos Konstantopoulos, Konstantinos Mastakas, Nikolaos Vathis, Damianos Gavalas, Grammati E. Pantziou

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.003

zbMATH Keywords

approximation algorithmsinapproximabilityarc orienteering problemmixed orienteering problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows

Cites Work

• A matheuristic for the team orienteering arc routing problem
• The directed orienteering problem
• The orienteering problem: a survey
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• Improved algorithms for orienteering and related problems
• The orienteering problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

This page was built for publication: Approximation algorithms for the arc orienteering problem