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

DOI10.1287/MNSC.21.5.591MaRDI QIDQ4074311zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(19)

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

This page was built for publication: Note—A Computational Survey of Methods for the Set Covering Problem

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