The Set-Covering Problem: A New Implicit Enumeration Algorithm
From MaRDI portal
Publication:4162967
DOI10.1287/opre.25.5.760zbMath0383.90077OpenAlexW2158446314MaRDI QIDQ4162967
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.5.760
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Exact enumeration problems, generating functions (05A15) Linear programming (90C05) Boolean programming (90C09) Combinatorial aspects of packing and covering (05B40)
Related Items (15)
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems ⋮ On some difficult linear programs coming from set partitioning ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ A network relaxation based enumeration algorithm for set partitioning ⋮ Use of hidden network structure in the set partitioning problem ⋮ Implicit enumeration algorithms for the set-partitioning problem ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ Information-theoretic approaches to branching in search ⋮ Locational analysis ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ The multicovering problem ⋮ Genetic clustering algorithms. ⋮ An algorithm for set covering problem ⋮ An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs ⋮ Algorithms for large scale set covering problems
This page was built for publication: The Set-Covering Problem: A New Implicit Enumeration Algorithm
