Heuristic method for the set covering problem

Operations Research

Volumn 47, Issue 5, 1999, Pages 730-743

  Caprara, Alberto ^a   Fischetti, Matteo ^b   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ITALIAN OPERATIONAL RESEARCH SOCIETY; ITALIAN RAILWAY COMPANY; SET COVERING PROBLEM;

HEURISTIC METHODS;

EID: 0033351565     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.5.730     Document Type: Article

References (19)

1. 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, March.
2. _. 1994b. Verbale Commissione Concorso FASTER, Italy. July and September.
3. Balas, E. 1983. A class of location, distribution and scheduling problems: modeling and solution methods. P. Gray, L. Yuanzhang, eds. Proceedings of the Chinese-U.S. Symposium on Systems Analysis. J. Wiley and Sons, New York.
4. _, M. C. Carrera. 1996. A dynamic subgradient-based branch and bound procedure for set covering. Oper. Res. 44 875-890.
5. _, A. Ho. 1980. Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. Math. Programming Study 12 37-60.
6. Beasley, J. E. 1987. An algorithm for set covering problems. European J. Oper. Res. 31 85-93.
7. _. 1990a. A Lagrangian heuristic for set covering problems. Naval Res. Logistics 37 151-164.
8. _. 1990b. OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41 1069-1072.
9. _, P. C. Chu. 1996. A genetic algorithm for the set covering problem. European J. Oper. Res. 94 392-404.
10. _, K. Jörnsten. 1992. Enhancing an algorithm for set covering problems. European J. Oper. Res. 58 293-300.
11. Carraresi, P., G. Gallo. 1986. Optimization models in mass transit resource management. Ricerca Operativa 38 121-150.
12. Ceria, S., P. Nobili, A. Sassano. 1995. A Lagrangian-based heuristic for large-scale set covering problems. Technical Report R.406, IASI-CNR, Roma, To appear in Math. Programming.
13. Dongarra, J. J. 1993. Performance of various computers using standard linear equations software. Technical Report No. CS-89-85, Computer Science Department, University of Tennessee, November.
14. Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
15. _, P. Kedia. 1990. Optimal solutions of set covering/partitioning problems using dual heuristics. Management Sci. 36 674-688.
16. Held, M., R. M. Karp. 1971. The traveling salesman problem and minimum spanning trees: Part II. Math. Programming 1 6-25.
17. Lorena, L. A. N., F. B. Lopes. 1994. A surrogate heuristic for set covering problems. European J. Oper. Res. 79 138-150.
18. Nobili, P., A. Sassano. 1992. A separation routine for the set covering polytope. E. Balas, G. Cornuejols, R. Kannan, eds. Integer Programming and Combinatorial Optimization. Proceedings of the 2nd IPCO Conference, Carnegie-Mellon University Press, Pittsburgh, PA.
19. Wedelin, D. 1995. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann. Oper. Res. 57 283-301.