-
Notifications
You must be signed in to change notification settings - Fork 10
Home
Michiel uit het Broek edited this page Mar 3, 2020
·
19 revisions
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.
Uit het Broek, MAJ, AH Schrotenboer, B Jargalsaikhan, KJ Roodbergen, and LC Coelho (2020). Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm. Operations Research.
Add URL to license here