Pages that link to "Item:Q5166298"

The following pages link to Exact Algorithms for the Clustered Vehicle Routing Problem (Q5166298):

Displaying 21 items.

• Sustainable operations (Q323159) (← links)
• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• Visual attractiveness in routing problems: a review (Q1634050) (← links)
• A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← 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)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← 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)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
• Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem (Q5740222) (← links)
• Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 (Q5879644) (← links)
• Dynamic community partitioning for e-commerce last mile delivery with time window constraints (Q6068725) (← 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)