Computational experience with approximation algorithms for the set covering problem
- 16 August 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 101 (1) , 81-92
- https://doi.org/10.1016/s0377-2217(96)00161-0
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A genetic algorithm for the set covering problemPublished by Elsevier ,2011
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- On the maximum number of edges in a c4‐free subgraph of qnJournal of Graph Theory, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- A connectionist model for diagnostic problem solvingIEEE Transactions on Systems, Man, and Cybernetics, 1989
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- A probabilistic analysis of the set covering problemAnnals of Operations Research, 1984
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975