Robust recoverable 0-1 optimization problems under polyhedral uncertainty

DOI10.1016/j.ejor.2019.04.017zbMath1430.90487arXiv1811.06719OpenAlexW2963341337WikidataQ128014017 ScholiaQ128014017MaRDI QIDQ2424772

Mikita Hradovich, Adam Kasperski, Paweł Zieliński

Publication date: 25 June 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.06719

zbMATH Keywords

combinatorial optimizationrobustness and sensitivity analysisrecoverable robustnesspolyhedral uncertainty

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• On the recoverable robust traveling salesman problem
• Min-max-min robust combinatorial optimization
• The most vital edges in the minimum spanning tree problem
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable robust spanning tree problem under interval uncertainty representations
• Robust recoverable and two-stage selection problems
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Recoverable robust shortest path problems
• Incremental Network Optimization: Theory and Algorithms
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Robust recoverable 0-1 optimization problems under polyhedral uncertainty