Recoverable robust spanning tree problem under interval uncertainty representations
From MaRDI portal
Publication:2410105
DOI10.1007/s10878-016-0089-6zbMath1407.90325arXiv1606.01342OpenAlexW2418396476WikidataQ59608132 ScholiaQ59608132MaRDI QIDQ2410105
Mikita Hradovich, Adam Kasperski, Paweł Zieliński
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01342
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)
Related Items
Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Matroid bases with cardinality constraints on the intersection ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Robust recoverable and two-stage selection problems ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ A linear time algorithm for the robust recoverable selection problem ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
Cites Work
- Unnamed Item
- Unnamed Item
- On the recoverable robust traveling salesman problem
- On the approximability of robust spanning tree problems
- Recoverable robust knapsacks: the discrete scenario case
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- The most vital edges in the minimum spanning tree problem
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Recoverable robust shortest path problems
- Iterative Methods in Combinatorial Optimization
- Incremental Network Optimization: Theory and Algorithms
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Increasing the Weight of Minimum Spanning Trees
- Recoverable Robust Combinatorial Optimization Problems
This page was built for publication: Recoverable robust spanning tree problem under interval uncertainty representations