arXiv
open access
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse#183145
- Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse#183095
- Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse#183045
- Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty#1077407
- Computational complexity of the recoverable robust shortest path problem in acyclic digraphs under interval budgeted uncertainty#1104826
Record · ID 182995
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive