CVRPSEP

swMATH11809MaRDI QIDQ23747

No author found.

Related Items (41)

The discrete time window assignment vehicle routing problem ⋮ A branch-and-cut algorithm for the preemptive swapping problem ⋮ Lifted and local reachability cuts for the vehicle routing problem with time windows ⋮ An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size ⋮ A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ An exact algorithm for a vehicle-and-driver scheduling problem ⋮ A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ A unified exact method for solving different classes of vehicle routing problems ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A generic exact solver for vehicle routing and related problems ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ A new mixed integer linear model for a rich vehicle routing problem with docking constraints ⋮ Reachability cuts for the vehicle routing problem with time windows ⋮ Exact hybrid algorithms for solving a bi-objective vehicle routing problem ⋮ Recent advances in vehicle routing exact algorithms ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ A Joint Vehicle Routing and Speed Optimization Problem ⋮ An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities ⋮ Exact algorithms for the traveling salesman problem with draft limits ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ The pyramidal capacitated vehicle routing problem ⋮ A branch‐and‐cut algorithm for the nonpreemptive swapping problem ⋮ Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ A generic exact solver for Vehicle Routing and related problems ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem ⋮ A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints ⋮ Solving capacitated arc routing problems using a transformation to the CVRP

This page was built for software: CVRPSEP