The Exact Subgraph Recoverable Robust Shortest Path Problem
From MaRDI portal
Publication:3649167
DOI10.1007/978-3-642-05465-5_9zbMath1266.90035OpenAlexW1657093223MaRDI QIDQ3649167
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (3)
Recoverable robust shortest path problems ⋮ On the recoverable robust traveling salesman problem ⋮ An \(s\)-\(t\) connection problem with adaptability
This page was built for publication: The Exact Subgraph Recoverable Robust Shortest Path Problem
