Pages that link to "Item:Q2339816"

The following pages link to A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816):

Displaying 45 items.

• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Using VRPSolver to efficiently solve the \textsc{differential harvest problem} (Q2108125) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
• On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
• Delivery route optimization with automated vehicle in smart urban environment (Q2193271) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• An optimization algorithm for a capacitated vehicle routing problem with time windows (Q2363743) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance (Q2668629) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
• Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)