A note on robustness tolerances for combinatorial optimization problems

DOI10.1016/j.ipl.2010.06.003zbMath1234.90016OpenAlexW2016580155MaRDI QIDQ765526

Marek Libura

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://rcin.org.pl/dlibra/docmetadata?showContent=true&id=144844

zbMATH Keywords

combinatorial problemsrobust solutionsrobustness tolerances

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria ⋮ Extending single tolerances to set tolerances ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function

Cites Work

• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Robustness in operational research and decision aiding: a multi-faceted issue
• On the complexity of postoptimality analysis of \(0/1\) programs
• On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
• Calculation of stability radii for combinatorial optimization problems
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Some concepts of stability analysis in combinatorial optimization
• Tolerance-based branch and bound algorithms for the ATSP
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Robust Convex Optimization
• Tolerance Sensitivity and Optimality Bounds in Linear Programming
• Robust Optimization of Large-Scale Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on robustness tolerances for combinatorial optimization problems