Pages that link to "Item:Q1127162"

The following pages link to A result on projection for the vehicle routing problem (Q1127162):

Displaying 36 items.

• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• The shared customer collaboration vehicle routing problem (Q1681166) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← 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)
• New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• Comparison of formulations for the inventory routing problem (Q2160484) (← links)
• Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game (Q2424787) (← links)
• Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
• A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
• On the vehicle routing problem with lower bound capacities (Q2861522) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)
• The family capacitated vehicle routing problem (Q6556080) (← links)