Pages that link to "Item:Q688914"

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

Displaying 28 items.

• Bilevel programming and the separation problem (Q403662) (← links)
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
• 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)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← 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)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← 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)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2327675) (← 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)
• (Q2861522) (← links)
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)