Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. E. Balas, “Set covering with cutting planes from conditional bounds”, MSRR N0. 399, Carnegie-Mellon University (July 1976).
2. E. Balas, “Cutting planes from conditional bounds: A new approach to set covering”, Mathematical Programming Study 12 (1980) 19–36 [this volume].
3. V. Chvátal, “A greedy heuristic for the set covering problem”, Publication 284, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal (1978).
4. J. Etcheberry, “The set covering problem: A new implicit enumeration algorithm”, Operations Research 25 (1977) 760–772.
5. J.L. Goffin, “On the convergence rates of subgradient optimization methods”, Mathematical programming 13 (1977) 329–348.
Cited by
195 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献