Approximation of min-max and min-max regret versions of some combinatorial optimization problems
From MaRDI portal
Publication:858438
DOI10.1016/j.ejor.2006.03.023zbMath1180.90359OpenAlexW2071335627MaRDI QIDQ858438
Cristina Bazgan, Hassene Aissi, Daniel Vanderpooten
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.023
Related Items (29)
Dominance for multi-objective robust optimization concepts ⋮ A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ On the approximability of robust spanning tree problems ⋮ Complexity results for common due date scheduling problems with interval data and minmax regret criterion ⋮ Combinatorial optimization problems with balanced regret ⋮ Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets ⋮ General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems ⋮ Complexity of the min-max (regret) versions of min cut problems ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ A unified approach to uncertain optimization ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ On the approximability of minmax (regret) network optimization problems ⋮ A randomized algorithm for the min-Max selecting items problem with uncertain weights ⋮ On scenario aggregation to approximate robust combinatorial optimization problems ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Representative scenario construction and preprocessing for robust combinatorial optimization problems ⋮ The polynomial robust knapsack problem ⋮ Robust pricing for airlines with partial information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact arborescences, matchings and cycles
- Robust discrete optimization and its applications
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Approximating Multiobjective Knapsack Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Combinatorial Problems: Reductibility and Approximation
- Reducibility among Combinatorial Problems
This page was built for publication: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
