Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. - Julien Bramel; Edward G. Coffman Jr.; Peter W. Shor; David Simchi-Levi (Oper. Res., 1992)

A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. - Daniel Bienstock; Julien Bramel; David Simchi-Levi (Math. Oper. Res., 1993)

Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures. - Shoshana Anily; Julien Bramel; David Simchi-Levi (Oper. Res., 1994)

A Location Based Heuristic for General Routing Problems. - Julien Bramel; David Simchi-Levi (Oper. Res., 1995)

Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows. - Julien Bramel; David Simchi-Levi (Oper. Res., 1996)

On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows. - Julien Bramel; David Simchi-Levi (Oper. Res., 1997)

Worst-case analyses, linear programming and the bin-packing problem. - Lap Mui Ann Chan; David Simchi-Levi; Julien Bramel (Math. Program., 1998)

A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. - Shoshana Anily; Julien Bramel; Alain Hertz (Oper. Res. Lett., 1999)

Periodic Scheduling with Service Constraints. - Shoshana Anily; Julien Bramel (Oper. Res., 2000)

Coordination of Production/Distribution Networks with Unbalanced Leadtimes. - Julien Bramel; Shobhna Goyal; Paul H. Zipkin (Oper. Res., 2000)

Set-Covering-Based Algorithms for the Capacitated VRP. - Julien Bramel; David Simchi-Levi (The Vehicle Routing Problem, 2002)

An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. - Shoshana Anily; Julien Bramel (Discret. Appl. Math., 2004)