Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)

DOI10.1007/s10288-006-0004-6zbMath1160.90628OpenAlexW2094229276MaRDI QIDQ882651

Hassene Aissi

Publication date: 24 May 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0004-6

zbMATH Keywords

complexityrobustness analysiscombinatorial optimizationapproximationmin-maxmin-max regretdata association

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (1)

Min-max and min-max (relative) regret approaches to representatives selection problem

Cites Work

• Complexity of the min-max and min-max regret assignment problems
• 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
• The robust shortest path problem with interval data via Benders decomposition
• A new relaxation algorithm and passive sensor data association
• Algorithms – ESA 2005
• Algorithms and Computation
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)