The following pages link to CVRPSEP (Q23747):
Displaying 41 items.
- The discrete time window assignment vehicle routing problem (Q319363) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← 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)
- Recent advances in vehicle routing exact algorithms (Q926561) (← 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)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
- A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- A generic exact solver for Vehicle Routing and related problems (Q2293094) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints (Q2430607) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← 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)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
- A Joint Vehicle Routing and Speed Optimization Problem (Q5137953) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
