Pages that link to "Item:Q2861522"
From MaRDI portal
The following pages link to On the vehicle routing problem with lower bound capacities (Q2861522):
Displaying 18 items.
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Capacitated transportation problem with bounds on rim conditions (Q859685) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← 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)
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- On a Labeled Vehicle Routing Problem (Q3401097) (← links)
- (Q3404305) (← links)
- Bounds and Heuristics for Capacitated Routing Problems (Q3705193) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- Computational Science – ICCS 2005 (Q5709516) (← links)