Pages that link to "Item:Q1336587"
From MaRDI portal
The following pages link to Probabilistic analysis of a capacitated vehicle routing problem. II (Q1336587):
Displaying 12 items.
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Dividing a territory among several vehicles (Q2815468) (← links)
- Probabilistic analysis for a multiple depot vehicle routing problem (Q3419619) (← links)
- Probabilistic analysis of a capactiated vehicle routing problem—I (Q3835656) (← 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)
- Locating depots for capacitated vehicle routing (Q4642406) (← links)
- The Capacitated Traveling Salesman Location Problem (Q5202830) (← links)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
- A Class of Euclidean Routing Problems with General Route Cost Functions (Q5753735) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)