Pages that link to "Item:Q4319776"

The following pages link to Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW (Q4319776):

Displaying 35 items.

• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints (Q2430607) (← links)
• Analysis of three mathematical models of the staff rostering problem (Q2434266) (← links)
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (Q2465940) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)
• Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem (Q2583711) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
• Medical waste collection considering transportation and storage risk (Q2664296) (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
• A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
• A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
• Optimal routing with failure-independent path protection (Q3057139) (← links)
• The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
• Dynamic programming algorithms for the elementary shortest path problem with resource constraints (Q3439161) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
• Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• A Joint Vehicle Routing and Speed Optimization Problem (Q5137953) (← links)
• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
• A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
• Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints (Q6168597) (← links)
• Two extended formulations for the virtual network function placement and routing problem (Q6179721) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem (Q6495886) (← links)