This repository provides the latest C++ implementation of the branch-and-cut framework and the valid inequalities that we used to write "Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm". The exact version as used while writing the manuscript can be found as an online supplement to the publication, see: https://doi.org/10.1287/opre.2020.2033.

If you have any questions, comments, and/or suggestions, please do not hesistate to contact us via [email protected] and [email protected]. If you found our code useful, then you can cite the work as follows:

Uit het Broek, Michiel A. J., Albert H. Schrotenboer, Bolor Jargalsaikhan, Kees Jan Roodbergen, and Leandro C. Coelho (2020). Asymmetric multi-depot routing problems: valid inequalities and a branch-and-cut algorithm. Operations Research.

For further details we refer to our Github wiki page: https://github.com/michieluithetbroek/A-MDVRP/wiki.