Combinatorial optimization problems with balanced regret

DOI10.1016/j.dam.2022.11.013OpenAlexW3215964336MaRDI QIDQ2685694

Marc Goerigk, Michael Hartisch

Publication date: 22 February 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12470

zbMATH Keywords

decision criteriarobust optimizationbudgeted uncertaintymin-max regretselection problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Mathematical economics (91Bxx) Operations research and management science (90Bxx)

Related Items (1)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• Complexity and in-approximability of a selection problem in robust optimization
• Pinpointing the complexity of the interval min-max regret knapsack problem
• On a constant factor approximation for minmax regret problems using a symmetry point scenario
• Approximation of min-max and min-max regret versions of some combinatorial optimization 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
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Minmax regret combinatorial optimization problems with investments
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• A double oracle approach to minmax regret optimization problems with interval data
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
• A survey of adjustable robust optimization
• On scenario aggregation to approximate robust combinatorial optimization problems
• Interval data minmax regret network optimization problems
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• An exact algorithm for the robust shortest path problem with interval data
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Approximating the min-max (regret) selecting items problem
• A linear time algorithm for the robust recoverable selection problem
• Robust multistage optimization with decision-dependent uncertainty
• Recoverable robust representatives selection problems with discrete budgeted uncertainty
• Combinatorial two-stage minmax regret problems under interval uncertainty
• Robust recoverable and two-stage selection problems
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Multistage robust discrete optimization via quantified integer programming
• Robust Discrete Optimization Problems with the WOWA Criterion
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• The Price of Robustness
• Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Combinatorial optimization problems with balanced regret