On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
Crossref DOI link: https://doi.org/10.1007/s11590-014-0828-5
Published Online: 2014-11-28
Published Print: 2015-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hoos, Holger H.
Stützle, Thomas
Text and Data Mining valid from 2014-11-28