The robust set covering problem with interval data
From MaRDI portal
(Redirected from Publication:367647)
Recommendations
- Robust min-max regret covering problems
- Improved handling of uncertainty and robustness in set covering problems
- Exact and heuristic algorithms for the interval data robust assignment problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Solving robust two-stage combinatorial optimization problems under convex uncertainty
Cites work
- scientific article; zbMATH DE number 1175963 (Why is no real title available?)
- A 3-flip neighborhood local search for the set covering problem
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A Gentle Introduction to Memetic Algorithms
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- A genetic algorithm for the set covering problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- A note on the selection of Benders' cuts
- A set covering reformulation of the pure fixed charge transportation problem
- Algorithms for the set covering problem
- An Analysis of Private and Public Sector Location Models
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An effective and simple heuristic for the set covering problem
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Exact and heuristic algorithms for the interval data robust assignment problem
- Generalized Benders decomposition
- Hybridizing exact methods and metaheuristics: a taxonomy
- Interval data minmax regret network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Optimized Crossover for the Independent Set Problem
- Partitioning procedures for solving mixed-variables programming problems
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Robust discrete optimization and its applications
- Staff scheduling and rostering: a review of applications, methods and models.
- The robust shortest path problem with interval data via Benders decomposition
- The use of dynamic programming in genetic algorithms for permutation problems
Cited in
(19)- Algorithms for the minmax regret path problem with interval data
- Sufficient optimality conditions and duality theory for interval optimization problem
- Set coverage and robust policy
- A minmax regret version of the time-dependent shortest path problem
- Formulation and algorithms for the robust maximal covering location problem
- Robust min-max regret covering problems
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- The robust (minmax regret) assembly line worker assignment and balancing problem
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Improved handling of uncertainty and robustness in set covering problems
- On exact solutions for the minmax regret spanning tree problem
- Exact and heuristic algorithms for the interval data robust assignment problem
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Combinatorial two-stage minmax regret problems under interval uncertainty
This page was built for publication: The robust set covering problem with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367647)
