New models for the robust shortest path problem: complexity, resolution and generalization

DOI10.1007/s10479-011-1004-2zbMath1272.90105OpenAlexW1972715957MaRDI QIDQ367636

Cécile Murat, Virginie Gabrel, Lei Wu

Publication date: 16 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1004-2

zbMATH Keywords

robustness analysisinteger linear programmingshortest path problemworst case criterion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Stochastic programming (90C15)

Related Items (8)

New reformulations of distributionally robust shortest path problem ⋮ Fuzzy and robust approach for decision-making in disaster situations ⋮ UAV routing by simulation-based optimization approaches for forest fire risk mitigation ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ Robust location of new housing developments using a choice model ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Portfolio optimization with \(pw\)-robustness ⋮ Recent advances in robust optimization: an overview

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The computational complexity of the relative robust shortest path problem with interval data
• Complexity of the min-max and min-max regret assignment problems
• Robustness in operational research and decision aiding: a multi-faceted issue
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• Robust discrete optimization and network flows
• A branch and bound algorithm for the robust shortest path problem with interval data.
• Interval data minmax regret network optimization problems
• An exact algorithm for the robust shortest path problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• Recourse problem of the 2-stage robust location transportation problem
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Linear programming with interval right hand sides
• The Price of Robustness
• Robust solutions and methods in decision-aid
• Robustness and duality in linear programming
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data

This page was built for publication: New models for the robust shortest path problem: complexity, resolution and generalization