Author:
Caprara Alberto,Fischetti Matteo,Toth Paolo
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. E. Balas and M. C. Carrera, “A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering”, Management Sciences Research Report No. MSSR 568(R), GSIA, Carnegie-Mellon University, October 1991, revised May 1995.
2. E. Balas and A. Ho, “Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study”, Mathematical Programming Study 12 (1980) 37–60.
3. J.E. Beasley, “A Lagrangian Heuristic for Set Covering Problems”, Naval Research Logistics 37 (1990) 151–164.
4. J.E. Beasley, “OR-Library: Distributing Test Problems by Electronic Mail”, Journal of the Operational Research Society 41 (1990) 1069–1072.
5. J.E. Beasley and P.C. Chu, “A Genetic Algorithm for the Set Covering Problem”, Working Paper, The Management School, Imperial College, London, July 1994.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献