The robust set covering problem with interval data
From MaRDI portal
Publication:367647
DOI10.1007/S10479-011-0876-5zbMATH Open1272.90075OpenAlexW1972280695MaRDI QIDQ367647FDOQ367647
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0876-5
heuristicscombinatorial optimizationgenetic algorithmsbranch-and-cutset covering problemBenders decompositionminmax regret optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- A genetic algorithm for the set covering problem
- Robust discrete optimization and its applications
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- An Analysis of Private and Public Sector Location Models
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Interval data minmax regret network optimization problems
- Algorithms for the set covering problem
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- An effective and simple heuristic for the set covering problem
- Staff scheduling and rostering: a review of applications, methods and models.
- The robust shortest path problem with interval data via Benders decomposition
- A Gentle Introduction to Memetic Algorithms
- On the complexity of a class of combinatorial optimization problems with uncertainty
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- A 3-flip neighborhood local search for the set covering problem
- A Benders decomposition approach for the robust spanning tree problem with interval data
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Hybridizing exact methods and metaheuristics: a taxonomy
- Exact and heuristic algorithms for the interval data robust assignment problem
- The use of dynamic programming in genetic algorithms for permutation problems
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- A set covering reformulation of the pure fixed charge transportation problem
- Optimized Crossover for the Independent Set Problem
- Discrete optimization with interval data. Minmax regret and fuzzy approach
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
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
- 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
- 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
Uses Software
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)
