Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem

DOI10.1287/OPRE.2016.1491MaRDI QIDQ5740222zbMATH OpenOpenAlexFDO

Authors Maaike Hoogeboom, Maria Battarra, Güneş Erdogăn, Daniele Vigo

Publication date 25 July 2016

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2016.1491

zbMATH Keywords

branch and cutclustersvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• Exact algorithms for the clustered vehicle routing problem

Cited in

(3)

• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• A unified exact approach for clustered and generalized vehicle routing problems
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem

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