Pages that link to "Item:Q1754109"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109):
Displaying 10 items.
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- New valid inequalities for the two-echelon capacitated vehicle routing problem (Q1742205) (← links)
- Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
- Van-based robot hybrid pickup and delivery routing problem (Q2076867) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← links)
- A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout (Q2086954) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations (Q6599061) (← links)