scientific article; zbMATH DE number 1234739

zbMath0912.90113MaRDI QIDQ4221472

N. R. Achuthan, Stephen P. Hill, Louis Caccetta

Publication date: 3 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimizationvehicle routingcutting planesbranch-and-cutcapacitated vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (8)

New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ On the vehicle routing problem ⋮ Branch and cut methods for network optimization ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem

This page was built for publication: