An efficient heuristic for large set covering problems
From MaRDI portal
Publication:3318543
DOI10.1002/nav.3800310118zbMath0534.90064OpenAlexW2023444198MaRDI QIDQ3318543
Francis J. Vasko, George R. Wilson
Publication date: 1984
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800310118
combinatorial optimizationheuristic algorithmcomputational experiencecomparison of algorithmsrandom test problemslarge set covering problemsrandom selection rule
Numerical mathematical programming methods (65K05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A surrogate heuristic for set covering problems ⋮ Two new heuristics for the location set covering problem ⋮ Solving large set covering problems on a personal computer ⋮ Bin packing problems in one dimension: Heuristic solutions and confidence intervals ⋮ An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ An effective and simple heuristic for the set covering problem ⋮ On the Weibull cost estimation of building frames designed by simulated annealing ⋮ Hybrid heuristic algorithms for set covering. ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ Un nuevo resultado sobre la complejidad del problema delP-centro ⋮ Surrogate constraint normalization for the set covering problem ⋮ Heuristic solutions and confidence intervals for the multicovering problem ⋮ What is the best greedy-like heuristic for the weighted set covering problem? ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ Dominant, an algorithm for the \(p\)-center problem. ⋮ An adaptation of SH heuristic to the location set covering problem ⋮ A genetic algorithm for the set covering problem ⋮ Heuristic methods and applications: A categorized survey ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ Using a facility location algorithm to solve large set covering problems ⋮ A set covering approach for multi-depot train driver scheduling ⋮ Column generation extensions of set covering greedy heuristics
Cites Work
