Bramel J., Simchi-Levi D..  2002.  Set-Covering Based Algorithms for the Capacitated VRP. The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications.

Chan L.M, Simchi-Levi D., Bramel J..  1998.  Worst-case Analyses, Linear Programming and the Bin-packing Problem. Mathematical Programming. 83

Bramel J., Rhee W.T, Simchi-Levi D..  1997.  Average Case Analysis of the Bin-Packing Problem with General Cost Structure. Naval Research Logistics. 44

Braca J., Bramel J., Posner B., Simchi-Levi D..  1997.  A Computerized Approach to the New York City School Bus Routing Problem. IIE Transactions. 29

Bramel J., Simchi-Levi D..  1997.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem. Operations Research. 45

Bramel J., Simchi-Levi D..  1996.  Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research. 44

Bramel J., Simchi-Levi D..  1995.  A Location Based Heuristic for General Routing Problems. Operations Research. 43

Anily S., Bramel J., Simchi-Levi D..  1994.  Worst-Case Analysis of Heuristics for the Bin-Packing Problem with General Cost Structure. Operations Research. 42

Bramel J., Li C.L, Simchi-Levi D..  1993.  Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences. 13

Bienstock D., Bramel J., Simchi-Levi D..  1993.  A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Mathematics of Operations Research. 18

Bramel J., Coffman, Jr. E.G, Shor P.W, Simchi-Levi D..  1992.  Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research. 40