Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem

DOI10.1287/ijoc.1040.0125zbMath1241.90186OpenAlexW2073689923MaRDI QIDQ2892303

Klaus M. Wenger, Gerhard Reinelt

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1040.0125

zbMATH Keywords

transportationvehicle routingbranch and cutgeneric cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ A branch\&cut approach to recharging and refueling infrastructure planning

Uses Software

• ABACUS

This page was built for publication: Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem