On a Class of Interval Data Minmax Regret CO Problems

DOI10.1007/978-3-540-77903-2_19zbMath1209.90298OpenAlexW1594305479MaRDI QIDQ5391890

Eduardo Álvarez-Miranda, Alfredo Candia-Véjar

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_19

zbMATH Keywords

approximation algorithmminmax regretinterval data

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• The computational complexity of the relative robust shortest path problem with interval data
• Minimax regret spanning arborescences under uncertain costs
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust discrete optimization and its applications
• Interval data minmax regret network optimization problems
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Finding the k Shortest Paths
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data

This page was built for publication: On a Class of Interval Data Minmax Regret CO Problems