Approximation algorithms for the arc orienteering problem
Authors:
- Damianos GavalasDamianos Gavalas
- Charalampos KonstantopoulosCharalampos Konstantopoulos
- Konstantinos MastakasKMKonstantinos Mastakas
- Grammati PantziouGPGrammati Pantziou
- Nikolaos VathisNVNikolaos Vathis
- 1 February 2015
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 115 (2) , 313-315
Abstract
No abstract availableKeywords
Funding Information
- eCOMPASS (288094)
- MOVESMART (609026)
This publication has 9 references indexed in Scilit:
- The Team Orienteering Arc Routing ProblemTransportation Science, 2014
- A survey on algorithmic approaches for solving tourist trip design problemsJournal of Heuristics, 2014
- Improved algorithms for orienteering and related problemsACM Transactions on Algorithms, 2012
- The planning of cycle trips in the province of East FlandersOmega, 2011
- The Directed Orienteering ProblemAlgorithmica, 2011
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- Approximation Algorithms for Orienteering and Discounted-Reward TSPSIAM Journal on Computing, 2007
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithmEuropean Journal of Operational Research, 2000
- The orienteering problemNaval Research Logistics (NRL), 1987