Pages that link to "Item:Q2422737"
From MaRDI portal
The following pages link to Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737):
Displaying 10 items.
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic (Q2673293) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- Iterated local search for the vehicle routing problem with a private fleet and a common carrier (Q5059448) (← links)
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers (Q5387416) (← links)
