Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. V. Chvatal, Greedy Heuristics for the Set-Covering Problem,Math. of Oper. Res. 4 (3), (1979), 233–235.
2. G. Cornuéjols, G. L. Nemhauser andL. A. Wolsey, A Canonical Representation of Simple Plant Location Problems and Its Applications,SIAM J. Alg. Disc. Math. 1, (1980), 261–272.
3. G. Dobson, Worst Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data,Technical Report SOL 80-25, Stanford, October 1980.
4. M. L. Fisher andL. A. Wolsey, On the Greedy Heuristic for Covering and Packing Problems,CORE, DP 8124, Louvain-la-Neuve, May 1981.
5. D. S. Johnson, Approximation Algorithms for Combinatorial problems,J. Comput. System Sci. 9, (1974), 256–298.
Cited by
304 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献