A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
- 3 June 2023
- book chapter
- Published by Springer Nature
- p. 87-98
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Genetic Algorithm for the Thief Orienteering Problem2020
- Analysis of baseline evolutionary algorithms for the packing while travelling problem2019
- A Fully Polynomial Time Approximation Scheme for Packing While Traveling2019
- The Thief Orienteering Problem: Formulation and Heuristic Approaches2018
- Attractive orienteering problem with proximity and timing interactionsEuropean Journal of Operational Research, 2018
- The Packing While Traveling ProblemEuropean Journal of Operational Research, 2017
- Orienteering Problem: A survey of recent variants, solution approaches and applicationsEuropean Journal of Operational Research, 2016
- The travelling thief problem: The first step in the transition from theoretical problems to realistic problems2013
- On approximating the longest path in a graphAlgorithmica, 1997
- The orienteering problemNaval Research Logistics (NRL), 1987