Pages that link to "Item:Q1991101"
From MaRDI portal
The following pages link to The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101):
Displaying 15 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration (Q2028763) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A PTAS for bounded-capacity vehicle routing in planar graphs (Q2285086) (← links)
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing (Q2401157) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- Bounds and Heuristics for Capacitated Routing Problems (Q3705193) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- (Q5417633) (← links)
- Multi‐objective optimization of transporting blood products by routing UAVs: the case of Istanbul (Q6056109) (← links)
- Improved approximation algorithms for the \(k\)-path partition problem (Q6635814) (← links)