Pages that link to "Item:Q1908292"

The following pages link to A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292):

Displaying 18 items.

• A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• A metaheuristic for stochastic service network design (Q707730) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• An algorithm for the capacitated vehicle routing problem with route balancing (Q1022391) (← 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)
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← 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)
• A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)