An exact algorithm for the hazardous orienteering problem

DOI10.1002/NET.22279MaRDI QIDQ6936278zbMATH OpenFDO

Authors Roberto Montemanni, Derek H. Smith

Publication date 1 September 2025

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22279

zbMATH Keywords

hazardous applicationsmixed integer linear programmingmodel-based algorithmsorienteering problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Linear programming (90C05) Mixed integer programming (90C11)

Cites work

• A model-based algorithm for the probabilistic orienteering problem
• A tabu search algorithm for the probabilistic orienteering problem
• Distributionally robust stochastic knapsack problem
• Exact algorithms for the 0-1 time-bomb knapsack problem
• scientific article; zbMATH DE number 2064416 (Why is no real title available?)
• Low Probability—High Consequence Considerations in Routing Hazardous Material Shipments
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
• Model-based algorithms for the 0-1 time-bomb knapsack problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
• The hazardous orienteering problem
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The orienteering problem: a survey
• The probabilistic orienteering problem
• Vehicle Routing

This page was built for publication: An exact algorithm for the hazardous orienteering problem

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