scientific article; zbMATH DE number 1234739

MaRDI QIDQ4221472zbMATH OpenFDO

Authors N. R. Achuthan, Louis Caccetta, S. P. Hill

Publication date 3 January 1999

zbMATH Keywords

branch-and-cutcapacitated vehicle routing problemcombinatorial optimizationcutting planesvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Integer Programming and Combinatorial Optimization
• A branch-and-cut algorithm for vehicle routing problems

Cited in

(22)

• A branch-and-cut algorithm for vehicle routing problems
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the capacitated vehicle routing problem
• Separating capacity constraints in the CVRP using tabu search
• Limited memory rank-1 cuts for vehicle routing problems
• New benchmark instances for the capacitated vehicle routing problem
• Stronger K-tree relaxations for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Improved branch-cut-and-price for capacitated vehicle routing
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• 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
• Maximally violated mod-p cuts for the capacitated vehicle-routing problem
• scientific article; zbMATH DE number 2134197 (Why is no real title available?)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• scientific article; zbMATH DE number 4070618 (Why is no real title available?)
• On the vehicle routing problem
• Numerically safe lower bounds for the capacitated vehicle routing problem
• Improved branch-cut-and-price for capacitated vehicle routing
• Branch and cut methods for network optimization
• Polyhedral study of the capacitated vehicle routing problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221472)