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.023zbMATH Open1180.90359OpenAlexW2071335627MaRDI QIDQ858438FDOQ858438
Recommendations
- Algorithms – ESA 2005
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 6472651 (Why is no real title available?)
- 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
- Exact arborescences, matchings and cycles
- Reducibility among combinatorial problems
- Robust discrete optimization and its applications
Cited in
(40)- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- On scenario aggregation to approximate robust combinatorial optimization problems
- Robustness in operational research and decision aiding: a multi-faceted issue
- Robust pricing for airlines with partial information
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Complexity of the min-max (regret) versions of min cut problems
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- On the approximability of robust spanning tree problems
- Approximating the shortest path problem with scenarios
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Combinatorial optimization problems with balanced regret
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Approximating the min-max (regret) selecting items problem
- Representative scenario construction and preprocessing for robust combinatorial optimization problems
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Algorithms – ESA 2005
- Recoverable robust knapsacks: the discrete scenario case
- Dominance for multi-objective robust optimization concepts
- Recoverable robust spanning tree problem under interval uncertainty representations
- Reference points and approximation algorithms in multicriteria discrete optimization
- Efficient Algorithms for k-Regret Minimizing Sets
- A unified approach to uncertain optimization
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- On the approximability of minmax (regret) network optimization problems
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- The polynomial robust knapsack problem
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Complexity results and exact algorithms for robust knapsack problems
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Just-in-time scheduling under scenario-based uncertainty
This page was built for publication: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858438)
