Pages that link to "Item:Q342039"
From MaRDI portal
The following pages link to Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039):
Displaying 11 items.
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution (Q1652425) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints (Q6088117) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
- Systematic review of the latest scientific publications on the vehicle routing problem (Q6544925) (← links)
