Pages that link to "Item:Q2783836"
From MaRDI portal
The following pages link to 2-path cuts for the vehicle routing problem with time windows (Q2783836):
Displaying 35 items.
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
- Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
- Projection results for vehicle routing (Q2583125) (← 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)
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
- The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (Q3392186) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows (Q4408696) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
- Path inequalities for the vehicle routing problem with time windows (Q5295485) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- An exact solution method for home health care scheduling with synchronized services (Q6077479) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price (Q6160335) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
- Models and algorithms for multiagent hierarchical routing with time windows (Q6546368) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
