Pages that link to "Item:Q2583125"

The following pages link to Projection results for vehicle routing (Q2583125):

Displaying 45 items.

• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← 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)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← 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)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• Comparison of formulations for the inventory routing problem (Q2160484) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints (Q2430607) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← 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)
• (Q2861522) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)