Home

Welcome to the Asymmetric Multi-Depot Vehicle Routing Problem (A-MDVRP) wiki!

The key components of the repository are the valid inequalities, the branch-and-bound, and the upper bound procedure.

How to cite

Uit het Broek, MAJ, AH Schrotenboer, B Jargalsaikhan, KJ Roodbergen, and LC Coelho. (2020) Asymmetric multi-depot routing problems: valid inequalities and a branch-and-cut algorithm

License

Add URL to license here