Julien Bramel

12 papers Journal 11
YearRankTypeTitle / Venue / Authors
2004 J jnl
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
Discret. Appl. Math.
Shoshana Anily, Julien Bramel
2002 — ch.
Set-Covering-Based Algorithms for the Capacitated VRP.
The Vehicle Routing Problem
Julien Bramel, David Simchi-Levi
2000 J jnl
Coordination of Production/Distribution Networks with Unbalanced Leadtimes.
Oper. Res.
Julien Bramel, Shobhna Goyal, Paul H. Zipkin
2000 J jnl
Periodic Scheduling with Service Constraints.
Oper. Res.
Shoshana Anily, Julien Bramel
1999 J jnl
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett.
Shoshana Anily, Julien Bramel, Alain Hertz
1998 J jnl
Worst-case analyses, linear programming and the bin-packing problem.
Math. Program.
Lap Mui Ann Chan, David Simchi-Levi, Julien Bramel
1997 J jnl
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.
Oper. Res.
Julien Bramel, David Simchi-Levi
1996 J jnl
Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows.
Oper. Res.
Julien Bramel, David Simchi-Levi
1995 J jnl
A Location Based Heuristic for General Routing Problems.
Oper. Res.
Julien Bramel, David Simchi-Levi
1994 J jnl
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.
Oper. Res.
Shoshana Anily, Julien Bramel, David Simchi-Levi
1993 J jnl
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.
Math. Oper. Res.
Daniel Bienstock, Julien Bramel, David Simchi-Levi
1992 J jnl
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.
Oper. Res.
Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi