The following pages link to Julien Bramel (Q705495):
Displaying 19 items.
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem (Q705496) (← links)
- Worst-case analyses, linear programming and the bin-packing problem (Q1290661) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- The Logic of Logistics (Q2851343) (← links)
- (Q3156770) (← links)
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands (Q4032588) (← links)
- A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands (Q4286934) (← links)
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures (Q4301293) (← links)
- Probabilistic Analysis of a Vehicle Routing Problem with Time Windows (Q4305484) (← links)
- (Q4363421) (← links)
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254) (← links)
- (Q4380371) (← links)
- (Q4499899) (← links)
- Periodic Scheduling with Service Constraints (Q4530657) (← links)
- (Q4532226) (← links)
- A probabilistic analysis of a fixed partition policy for the inventory-routing problem (Q4651724) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- A Location Based Heuristic for General Routing Problems (Q4897077) (← links)
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows (Q5689797) (← links)
