Algorithms for the thief orienteering problem on directed acyclic graphs

DOI10.1016/J.TCS.2024.114900MaRDI QIDQ6652432zbMATH OpenFDO

Authors Andrew Bloch-Hansen, Roberto Solis-Oba, Daniel R. Page

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114900

zbMATH Keywords

approximation algorithmapproximation schemedynamic programmingknapsack problemthief-orienteering problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Ants can orienteer a thief in their robbery
• Improved algorithms for orienteering and related problems
• The capacitated orienteering problem
• scientific article; zbMATH DE number 1839476

Cites work

• A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs
• Analysis of baseline evolutionary algorithms for the packing while travelling problem
• Ants can orienteer a thief in their robbery
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Attractive orienteering problem with proximity and timing interactions
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• On approximating the longest path in a graph
• The orienteering problem
• The orienteering problem: a survey
• The packing while traveling problem

Cited in

(2)

• Ants can orienteer a thief in their robbery
• The thief orienteering problem on 2-terminal series-parallel graphs

This page was built for publication: Algorithms for the thief orienteering problem on directed acyclic graphs

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