Pages that link to "Item:Q3911683"

The following pages link to Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683):

Displaying 36 items.

• Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem (Q2508207) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• Arc routing in a node routing environment (Q2571193) (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem (Q2583711) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
• Split delivery routing (Q3035116) (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
• Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496) (← links)
• A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
• A Heuristic Algorithm for Multi-Period Delivery Planning Problems (Q3494695) (← links)
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)
• Routing a Heterogeneous Fleet of Vehicles (Q3564347) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM (Q3601297) (← links)
• Chain partitioning as a key element for building vehicle routing problem heuristics (Q3620287) (← links)
• The Minimum Spanning Tree Problem with Time Window Constraints (Q3773692) (← links)
• State-space relaxation procedures for the computation of bounds to routing problems (Q3908783) (← links)
• A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) (← links)
• Synchronized Traveling Salesman Problem (Q5084688) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• (Q5120561) (← links)
• A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem (Q6164388) (← links)
• Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)