Pages that link to "Item:Q2272311"
From MaRDI portal
The following pages link to Exact solution of the soft-clustered vehicle-routing problem (Q2272311):
Displaying 6 items.
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines (Q6060668) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)