Pages that link to "Item:Q5321991"

The following pages link to An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Q5321991):

Displaying 46 items.

• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
• A bi-objective model for the used oil location-routing problem (Q337643) (← links)
• Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← 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)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Disruption management in vehicle routing and scheduling for road freight transport: a review (Q1752346) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes (Q2178911) (← links)
• A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
• Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• Routing and scheduling field service operation by P-graph (Q2669568) (← links)
• Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
• Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
• Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses (Q6109817) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)