Exploring further advantages in an alternative formulation for the set covering problem
From MaRDI portal
Publication:783157
DOI10.1155/2020/5473501zbMath1459.90184OpenAlexW3043237840MaRDI QIDQ783157
Broderick Crawford, Jose M. Lanza-Gutierrez, Fernando Paredes, N. C. Caballe, Juan A. Gomez-Pulido, Ricardo L. Soto
Publication date: 30 July 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5473501
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid heuristic for the set covering problem
- A variable neighborhood search algorithm for the multimode set covering problem
- Surrogate constraint normalization for the set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A genetic algorithm for the generalised assignment problem
- An indirect genetic algorithm for a nurse-scheduling problem
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- What is the best greedy-like heuristic for the weighted set covering problem?
- A new distributed approximation algorithm for the maximum weight independent set problem
- An algorithm for set covering problem
- A new approach for solving set covering problem using jumping particle swarm optimization method
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- Variable and large neighborhood search to solve the multiobjective set covering problem
- An efficient heuristic for large set covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Cutting planes from conditional bounds: A new approach to set covering
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- A Heuristic Method for the Set Covering Problem
- The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Algorithms for the set covering problem
- A binary monkey search algorithm variation for solving the set covering problem
