Set Covering by an All Integer Algorithm
From MaRDI portal
Publication:5674333
DOI10.1145/321752.321753zbMath0258.65067OpenAlexW1997086134MaRDI QIDQ5674333
Ronald D. Koncal, Harvey M. Salkin
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
Related Items
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, Set partitioning mit linearen Randbedingungen, Enhancing an algorithm for set covering problems, Performance of a neural network method with set partitioning, Benchmark data set with service programs to approximately solve the set covering problem, The distribution of 1-widths of (0,1)-matrices, Opening a web site at which one can get a benchmark input data set to solve the set covering problem, A computational study of a genetic algorithm to solve the set covering problem, An approach to the solution of the set-covering problem
