The following pages link to (Q4532225):
Displaying 45 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- An optimization algorithm for the inventory routing problem with continuous moves (Q2468483) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← 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 branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
