Set Covering by an All Integer Algorithm

DOI10.1145/321752.321753MaRDI QIDQ5674333zbMATH OpenOpenAlexFDO

Authors Harvey M. Salkin, Ronald D. Koncal

Publication date 1973

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321752.321753

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cited in

(11)

• Set partitioning mit linearen Randbedingungen
• Enhancing an algorithm for set covering problems
• Performance of a neural network method with set partitioning
• The distribution of 1-widths of (0,1)-matrices
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
• A surrogate heuristic for set covering problems
• Integral simplex using decomposition with primal cutting planes
• Opening a web site at which one can get a benchmark input data set to solve the set covering problem
• An approach to the solution of the set-covering problem
• A computational study of a genetic algorithm to solve the set covering problem
• Benchmark data set with service programs to approximately solve the set covering problem

This page was built for publication: Set Covering by an All Integer Algorithm

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