Author:
Fahle Torsten,Tiemann Karsten
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Beasley, J.E.: A Lagrangian Heuristic for Set-Covering Problems. Naval Research Logistics 37, 151–164 (1990)
2. Caprara, A., Fischetti, M., Toth, P.: Algorithms for the Set Covering Problem. Annals of Operations Research 98, 353–371 (2001)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co, New York (1979)
4. Lecture Notes in Computer Science;K.M.J. Bontridder De,2002
5. Lecture Notes in Computer Science;B.V. Halldórsson,2001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献