Author:
Bertsimas Dimitris,Teo Chungpiaw,Vohra Rakesh
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference21 articles.
1. D. Bertsimas, C. Teo, R. Vohra, Nonlinear relaxations and improved randomized approximation algorithms for multicut problems, Proceedings of the Fourth IPCO Conference, 1995, pp. 29–39, in Networks, in press.
2. Rounding Algorithms for covering problems;Bertsimas;Math. Programming,1998
3. H. Brönnimann, M. Goodrich, Almost optimal set covers in finite VC-dimension, Proceedings of the 10th Annual Symposium Computational Geometry, 1994, pp. 293–301.
4. A greedy heuristic for the set-covering problem;Chvátal;Math. Oper. Res.,1979
5. Bin packing solved within 1+ε in linear time;Fernandez de la Vega;Combinatorica,1981
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献