Note—A Computational Survey of Methods for the Set Covering Problem

DOI10.1287/mnsc.21.5.591zbMath0314.65029OpenAlexW1993523753MaRDI QIDQ4074311

Samuel M. Korman, Nicos Christofides

Publication date: 1975

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.5.591

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

A-priori upper bounds for the set covering problem, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, A surrogate heuristic for set covering problems, On discrete optimization with ordering, On the facial structure of the set covering polytope, Facets and lifting procedures for the set covering polytope, Negotiation and cooperation in multi-agent environments, Implicit enumeration algorithms for the set-partitioning problem, Determining the Set of the Most Critical System Components—Optimization Approach, Hybrid heuristic algorithms for set covering., Ordered weighted average optimization in multiobjective spanning tree problem, Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach, Dominant, an algorithm for the \(p\)-center problem., Methods for task allocation via agent coalition formation, Simple Lagrangian heuristic for the set covering problem, An algorithm for set covering problem, Algorithms for large scale set covering problems, A formal model of diagnostic inference. I. Problem formulation and decomposition, A formal model of diagnostic inference. II. Algorithmic solution and application