Pages that link to "Item:Q688914"

The following pages link to Polyhedral study of the capacitated vehicle routing problem (Q688914):

Displayed 18 items.

• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) ‎ (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) ‎ (← links)
• A multi-stop routing problem (Q940857) ‎ (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) ‎ (← links)
• A result on projection for the vehicle routing problem (Q1127162) ‎ (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) ‎ (← links)
• Planning models for freight transportation (Q1278638) ‎ (← links)
• Some thoughts on combinatorial optimisation (Q1388818) ‎ (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) ‎ (← links)
• Separating capacity constraints in the CVRP using tabu search (Q1609917) ‎ (← links)
• Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) ‎ (← links)
• A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) ‎ (← links)
• Routing problems: A bibliography (Q1908308) ‎ (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) ‎ (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) ‎ (← links)
• Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) ‎ (← links)
• A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) ‎ (← links)
• Branch and cut methods for network optimization (Q5936762) ‎ (← links)