Exploring further advantages in an alternative formulation for the set covering problem
From MaRDI portal
(Redirected from Publication:783157)
Recommendations
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- Effective heuristics for the set covering with pairs problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A GRASP algorithm to solve the unicost set covering problem
- An effective and simple heuristic for the set covering problem
Cites work
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 2079889 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Greedy Heuristic for the Set-Covering Problem
- A Heuristic Method for the Set Covering Problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- A binary monkey search algorithm variation for solving the set covering problem
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the set covering problem
- A hybrid heuristic for the set covering problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A new approach for solving set covering problem using jumping particle swarm optimization method
- A new distributed approximation algorithm for the maximum weight independent set problem
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A variable neighborhood search algorithm for the multimode set covering problem
- Algorithms for the set covering problem
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- An electromagnetism metaheuristic for the unicost set covering problem
- An indirect genetic algorithm for a nurse-scheduling problem
- Cutting planes from conditional bounds: A new approach to set covering
- Enhancing an algorithm for set covering problems
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- Surrogate constraint normalization for the set covering problem
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- Variable and large neighborhood search to solve the multiobjective set covering problem
- What is the best greedy-like heuristic for the weighted set covering problem?
Cited in
(2)
This page was built for publication: Exploring further advantages in an alternative formulation for the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783157)
