An exact algorithm for the robust shortest path problem with interval data
From MaRDI portal
Publication:1885969
DOI10.1016/S0305-0548(03)00114-XzbMath1073.90055OpenAlexW2023727736MaRDI QIDQ1885969
Roberto Montemanni, Luca Maria Gambardella
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00114-x
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)
Related Items (46)
The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ Algorithms and uncertainty sets for data-driven robust shortest path problems ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ \( \alpha \)-reliable shortest path problem in uncertain time-dependent networks ⋮ Robust vertex \(p\)-center model for locating urgent relief distribution centers ⋮ A minimum expected regret model for the shortest path problem with solution-dependent probability distributions ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Minmax regret combinatorial optimization problems with investments ⋮ The computational complexity of the relative robust shortest path problem with interval data ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ An approach to the distributionally robust shortest path problem ⋮ Ranking robustness and its application to evacuation planning ⋮ How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis ⋮ A double oracle approach to minmax regret optimization problems with interval data ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Deterministic risk control for cost-effective network connections ⋮ Combinatorial optimization problems with balanced regret ⋮ Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks ⋮ On modelling and solving the shortest path problem with evidential weights ⋮ Algorithms for the minmax regret path problem with interval data ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ Robust optimization of graph partitioning involving interval uncertainty ⋮ A branch and bound algorithm for the robust shortest path problem with interval data. ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ An enhanced exact procedure for the absolute robust shortest path problem ⋮ Minimum power multicasting problem in wireless networks ⋮ Linear programming with interval right hand sides ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ On robust online scheduling algorithms ⋮ Reduction approaches for robust shortest path problems ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Measuring and mitigating the effects of cost disturbance propagation in multi-echelon apparel supply chains ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Combinatorial optimization in system configuration design ⋮ Distributionally robust maximum probability shortest path problem ⋮ An approximation algorithm for interval data minmax regret combinatorial optimization problems ⋮ Integer programming formulations for the shared multicast tree problem ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ The robust shortest path problem in series -- parallel multidigraphs with interval data ⋮ Robust Optimization for the Hazardous Materials Transportation Network Design Problem ⋮ Robust optimization for the hazardous materials transportation network design problem
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Finding the k Shortest Paths
- The robust spanning tree problem with interval data
This page was built for publication: An exact algorithm for the robust shortest path problem with interval data
