The Set-Covering Problem: A New Implicit Enumeration Algorithm

DOI10.1287/OPRE.25.5.760MaRDI QIDQ4162967zbMATH OpenOpenAlexFDO

Authors Javier Etcheberry

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Boolean programming (90C09)

Cited in

(15)

• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• A network relaxation based enumeration algorithm for set partitioning
• Implicit enumeration algorithms for the set-partitioning problem
• Locational analysis
• The multicovering problem
• Algorithms for large scale set covering problems
• 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
• An algorithm for set covering problem
• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• Information-theoretic approaches to branching in search
• Use of hidden network structure in the set partitioning problem
• Learning in combinatorial optimization: what and how to explore
• Genetic clustering algorithms.
• Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities

This page was built for publication: The Set-Covering Problem: A New Implicit Enumeration Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162967)