A heuristic algorithm for the set covering problem
From MaRDI portal
Recommendations
- A Heuristic Method for the Set Covering Problem
- scientific article; zbMATH DE number 4121754
- Simple Lagrangian heuristic for the set covering problem
- A two-phase heuristic for set covering
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Cites work
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Lagrangian-based heuristic for large-scale set covering problems
- A surrogate heuristic for set covering problems
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(44)- Solving large set covering problems on a personal computer
- A probabilistic heuristic for a computationally difficult set covering problem
- Pick-and-choose heuristics for partial set covering
- Enhancing an algorithm for set covering problems
- An adaptation of SH heuristic to the location set covering problem
- Simple Lagrangian heuristic for the set covering problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for large scale set covering problems
- Clustering heuristics for set covering
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A surrogate heuristic for set covering problems
- Hybrid heuristic algorithms for set covering.
- Network based heuristics for the set covering problem
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Thinning out Steiner trees: a node-based model for uniform edge costs
- What is the best greedy-like heuristic for the weighted set covering problem?
- An algorithm for set covering problem
- Column generation extensions of set covering greedy heuristics
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- A two-phase heuristic for set covering
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- A set-covering-based heuristic approach for bin-packing problems
- An efficient heuristic for large set covering problems
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- Hybrid heuristics for minimum cardinality set covering problems
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Ad hoc heuristic for the cover printing problem
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Note: A local-search heuristic for large set-covering problems
- A New Efficient Heuristic for the Minimum Set Covering Problem
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Algorithms for the set covering problem
- Perfect, ideal and balanced matrices
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Using a facility location algorithm to solve large set covering problems
- An effective and simple heuristic for the set covering problem
- A GRASP algorithm to solve the unicost set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
This page was built for publication: A heuristic algorithm for the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645914)
