A note on robustness tolerances for combinatorial optimization problems
From MaRDI portal
Recommendations
- On the robustness of optimal solutions for combinatorial optimization problems
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
- scientific article; zbMATH DE number 764410
- Recoverable Robust Combinatorial Optimization Problems
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
Cites work
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- scientific article; zbMATH DE number 1852192 (Why is no real title available?)
- scientific article; zbMATH DE number 969937 (Why is no real title available?)
- Calculation of stability radii for combinatorial optimization problems
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
- On the complexity of postoptimality analysis of \(0/1\) programs
- On the robustness of optimal solutions for combinatorial optimization problems
- Robust Optimization of Large-Scale Systems
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robustness in operational research and decision aiding: a multi-faceted issue
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Some concepts of stability analysis in combinatorial optimization
- Tolerance sensitivity and optimality bounds in linear programming
- Tolerance-based branch and bound algorithms for the ATSP
Cited in
(15)- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
- On the robustness of optimal solutions for combinatorial optimization problems
- Assessing the effect of multiple cost changes using reverse set tolerances
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- On accuracy, robustness and tolerances in vector Boolean optimization
- Global tolerances in the problems of combinatorial optimization with an additive objective function
- Recoverable Robust Combinatorial Optimization Problems
- Size versus truncation robustness in the assignment problem
- scientific article; zbMATH DE number 1852192 (Why is no real title available?)
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- Complexity and in-approximability of a selection problem in robust optimization
- From Optimality Robustness To Sufficiency and Completeness
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- Extending single tolerances to set tolerances
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
This page was built for publication: A note on robustness tolerances for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765526)
