The Exact Subgraph Recoverable Robust Shortest Path Problem

DOI10.1007/978-3-642-05465-5_9MaRDI QIDQ3649167zbMATH OpenOpenAlexFDO

Authors Christina Büsing

Publication date 3 December 2009

Published in Robust and Online Large-Scale Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-05465-5_9

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Recoverable robust shortest path problems
• An enhanced exact procedure for the absolute robust shortest path problem
• Robust shortest path problems
• On the robust shortest path problem.
• Algorithm Theory - SWAT 2004
• Robust subgraphs for trees and paths
• An exact algorithm for the robust shortest path problem with interval data
• New models for the robust shortest path problem: complexity, resolution and generalization
• Reduction approaches for robust shortest path problems
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs

Cited in

(3)

• An s-t connection problem with adaptability
• Recoverable robust shortest path problems
• On the recoverable robust traveling salesman problem

This page was built for publication: The Exact Subgraph Recoverable Robust Shortest Path Problem

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