Approximation algorithms for the arc orienteering problem

DOI10.1016/J.IPL.2014.10.003zbMATH Open1302.68316OpenAlexW2052970971MaRDI QIDQ477675FDOQ477675

Authors: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Nikolaos Vathis, Grammati 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

Recommendations

• Improved algorithms for orienteering and related problems
• A branch-and-cut algorithm for the orienteering arc routing problem
• The capacitated orienteering problem
• The directed orienteering problem
• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems

zbMATH Keywords

approximation algorithmsinapproximabilityarc orienteering problemmixed orienteering problem

Mathematics Subject Classification ID

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

Cites Work

• The 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
• A matheuristic for the team orienteering arc routing problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Improved algorithms for orienteering and related problems
• The directed orienteering problem

Cited In (10)

• Title not available (Why is that?)
• Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem
• Title not available (Why is that?)
• An algorithm for minimum cost arc-connectivity orientations
• Title not available (Why is that?)
• A matheuristic for the team orienteering arc routing problem
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

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

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