Robust min-max regret covering problems
From MaRDI portal
Recommendations
- The robust set covering problem with interval data
- Formulation and algorithms for the robust maximal covering location problem
- Improved handling of uncertainty and robustness in set covering problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Cites work
- A Heuristic Method for the Set Covering Problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A note on the selection of Benders' cuts
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- Algorithms for the set covering problem
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Covers and packings in a family of sets
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Designing robust emergency medical service via stochastic programming
- Formulation and algorithms for the robust maximal covering location problem
- Fundamentals of scatter search and path relinking
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Improved handling of uncertainty and robustness in set covering problems
- Intelligent-guided adaptive search for the maximum covering location problem
- Introduction to algorithms.
- Logic-based Benders decomposition
- Looking ahead with the pilot method
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minimax regret p-center location on a network with demand uncertainty
- MIP reformulations of the probabilistic set covering problem
- Partitioning procedures for solving mixed-variables programming problems
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Probabilistic partial set covering with an oracle for chance constraints
- Robust discrete optimization and its applications
- Robustness in operational research and decision aiding: a multi-faceted issue
- Strategic facility location: A review
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- The Price of Robustness
- The Probabilistic Set-Covering Problem
- The robust set covering problem with interval data
Cited in
(17)- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Improved handling of uncertainty and robustness in set covering problems
- Formulation and algorithms for the robust maximal covering location problem
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- On minimax robustness: A general approach and applications
- Thresholded Covering Algorithms for Robust and Max-min Optimization
- The robust set covering problem with interval data
- Thresholded covering algorithms for robust and max-min optimization
- Set coverage and robust policy
- scientific article; zbMATH DE number 1457529 (Why is no real title available?)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Robust multicovers: algorithms and complexity
- On the complexity of robust multi-stage problems with discrete recourse
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Advances in the decision-making of set covering models under uncertainty
- Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization
This page was built for publication: Robust min-max regret covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2162527)
