A branch-and-cut algorithm for the balanced traveling salesman problem
Crossref DOI link: https://doi.org/10.1007/s10878-023-01097-4
Published Online: 2024-01-28
Published Print: 2024-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Vo, Thi Quynh Trang
Baiou, Mourad
Nguyen, Viet Hung http://orcid.org/0000-0003-2181-3847
Text and Data Mining valid from 2024-01-28
Version of Record valid from 2024-01-28
Article History
Accepted: 28 November 2023
First Online: 28 January 2024
Declartions
:
: The authors have not disclosed any competing interests.