The -reliable shortest path problem

zbMATH Open1277.90081MaRDI QIDQ2867322FDOQ2867322

Authors: Francesca Guerriero, Patrizia Beraldi 

Publication date: 11 December 2013

Published in: Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/2796

Recommendations

• Shortest path problem with uncertain arc lengths
• Shortest path problems with node failures
• An approach to the distributionally robust shortest path problem
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• On the robust shortest path problem.

zbMATH Keywords

shortest pathstochastic programmingheuristic approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Stochastic programming (90C15) Paths and cycles (05C38)

Cited In (3)

• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios

This page was built for publication: The \(\alpha\)-reliable shortest path problem

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