The thief orienteering problem on series-parallel graphs

DOI10.1007/978-3-031-60924-4_19MaRDI QIDQ7030718zbMATH OpenFDO

Authors Andrew Bloch-Hansen, Roberto Solis-Oba

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_19

zbMATH Keywords

approximation algorithmapproximation schemeknapsack problemseries-parallelthief orienteering problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs
• Ants can orienteer a thief in their robbery
• Attractive orienteering problem with proximity and timing interactions
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Topology of series-parallel networks

This page was built for publication: The thief orienteering problem on series-parallel graphs

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