Pages that link to "Item:Q5443715"
From MaRDI portal
The following pages link to Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715):
Displaying 15 items.
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Probabilistic analysis of a capacitated vehicle routing problem. II (Q1336587) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Using regression models to understand the impact of route-length variability in practical vehicle routing (Q2679006) (← links)
- Probabilistic analyses and practical algorithms for inventory-routing models (Q2781136) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- Probabilistic analysis for a multiple depot vehicle routing problem (Q3419619) (← links)
- (Q3799802) (← links)
- Probabilistic analysis of a capactiated vehicle routing problem—I (Q3835656) (← links)
- Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem (Q4876064) (← links)
- A Class of Euclidean Routing Problems with General Route Cost Functions (Q5753735) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
