The hazardous orienteering problem
From MaRDI portal
Publication:6179713
DOI10.1002/net.22129zbMath1529.90017OpenAlexW4308751215MaRDI QIDQ6179713
Alberto Santini, Claudia Archetti
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22129
orienteering problemhazardous material transportationcash-in-transit logisticsprimal and dual bounds
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- A two-stage approach to the orienteering problem with stochastic weights
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- The orienteering problem with stochastic travel and service times
- The selective travelling salesman problem
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- The probabilistic orienteering problem
- Vehicle routing with arrival time diversification
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- A dynamic and probabilistic orienteering problem
- Distributionally Robust Stochastic Knapsack Problem
- Integer Programming Formulation of Traveling Salesman Problems
- The orienteering problem
- The prize collecting traveling salesman problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Low Probability—High Consequence Considerations in Routing Hazardous Material Shipments
- Solving the Orienteering Problem through Branch-and-Cut
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
This page was built for publication: The hazardous orienteering problem
