Author:
Simchi-Levi David,Chen Xin,Bramel Julien
Reference13 articles.
1. Bienstock, D., & Simchi-Levi, D. (1993). A note on the prize collecting traveling salesman problem. Working Paper, Columbia University.
2. Bienstock, D., Bramel, J., & Simchi-Levi, D. (1993a). A probabilistic analysis of tour partitioning heuristics for the capacitated vehicle routing problem with unsplit demands. Mathematics of Operations Research, 18, 786–802.
3. Chan, L. M. A., Simchi-Levi, D., & Bramel, J. (1998). Worst-case analyses, linear programming and the bin-packing problem. Mathematical Programming, 83, 213–227.
4. Edmonds, J. (1965). Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B, 69B, 125–130.
5. Edmonds, J. (1971). Matroids and the greedy algorithm. Mathematical Programming, 1, 127–136.