A Heuristic Method for the Set Covering Problem

References

• Associazione Italiana di Ricerca Operativa and Ferrovie dello Stato SpA (1994a) . Metodi di Ottimizzazione delle Risorse su Larga Scala-F.A.S.T.ER, Bando di Concorso, Italy, MarchGoogle Scholar
• Associazione Italiana di Ricerca Operativa and Ferrovie dello Stato SpA (1994b) . Verbale Commissione Concorso FASTER, Italy. July and SeptemberGoogle Scholar
• Balas E., Gray P., Yuanzhang L. A class of location, distribution and scheduling problems: Modeling and solution methods. Proc. Chinese-U.S. Sympos. Systems Anal. (1983) (J. Wiley and Sons, New York) Google Scholar
• Balas E., Carrera M. C. A dynamic subgradient-based branch and bound procedure for set covering. Oper. Res. (1996) 44:875–890Link, Google Scholar
• Balas E., Ho A. Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study. Math. Programming Stud. (1980) 12:37–60Crossref, Google Scholar
• Beasley J. E. An algorithm for set covering problems. Eur. J. Oper. Res. (1987) 31:85–93Crossref, Google Scholar
• Beasley J. E. A Lagrangian heuristic for set covering problems. Naval Res. Logist. (1990a) 37:151–164Crossref, Google Scholar
• Beasley J. E. OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. (1990b) 41:1069–1072Crossref, Google Scholar
• Beasley J. E., Chu P. C. A genetic algorithm for the set covering problem. Eur. J. Oper. Res. (1996) 94:392–404Crossref, Google Scholar
• Beasley J. E., Jörnsten K. Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. (1992) 58:293–300Crossref, Google Scholar
• Carraresi P., Gallo G. Optimization models in mass transit resource management. Ricerca Operativa (1986) 38:121–150Google Scholar
• Ceria S., Nobili P., Sassano A. A Lagrangian-based heuristic for large-scale set covering problems. (1995) . Technical report R.406, IASI-CNR, Roma, To appear in Math. ProgrammingGoogle Scholar
• Dongarra J. J. Performance of various computers using standard linear equations software. (1993) . Technical report no. CS-89-85, Computer Science Department, University of Tennessee, NovemberGoogle Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18Link, Google Scholar
• Fisher M. L., Kedia P. Optimal solutions of set covering/partitioning problems using dual heuristics. Management Sci. (1990) 36:674–688Link, Google Scholar
• Held M., Karp R. M. The traveling salesman problem and minimum spanning trees: Part II. Math. Programming (1971) 1:6–25Crossref, Google Scholar
• Lorena L. A. N., Lopes F. B. A surrogate heuristic for set covering problems. Eur. J. Oper. Res. (1994) 79:138–150Crossref, Google Scholar
• Nobili P., Sassano A., Balas E., Cornuejols G., Kannan R. A separation routine for the set covering polytope. Integer Programming Combinatorial Optim. Proc. 2nd IPCO Conf. (1992) (Carnegie-Mellon University Press, Pittsburgh, PA) Google Scholar
• Wedelin D. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann. Oper. Res. (1995) 57:283–301Crossref, Google Scholar