Pages that link to "Item:Q2272311"

The following pages link to Exact solution of the soft-clustered vehicle-routing problem (Q2272311):

Displaying 10 items.

• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• 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 decomposition-based method for solving the clustered vehicle routing problem (Q5384360) (← links)
• A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines (Q6060668) (← links)
• A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem (Q6075257) (← 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)