Julien Bramel

According to our database1, Julien Bramel authored at least 12 papers between 1992 and 2004.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
Discret. Appl. Math., 2004

2002
Set-Covering-Based Algorithms for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

2000
Coordination of Production/Distribution Networks with Unbalanced Leadtimes.
Oper. Res., 2000

Periodic Scheduling with Service Constraints.
Oper. Res., 2000

1999
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett., 1999

1998
Worst-case analyses, linear programming and the bin-packing problem.
Math. Program., 1998

1997
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.
Oper. Res., 1997

1996
Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows.
Oper. Res., 1996

1995
A Location Based Heuristic for General Routing Problems.
Oper. Res., 1995

1994
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.
Oper. Res., 1994

1993
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.
Math. Oper. Res., 1993

1992
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.
Oper. Res., 1992


  Loading...