The Multi-Depot Family Traveling Salesman Problem and Clustered Variants: Mathematical Formulations and Branch-&-Cut Based Methods
AuthID
P-00X-5XN
P-00X-5XN
© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service