Handelsreizigersprobleem (Dutch Wikipedia)

Analysis of information sources in references of the Wikipedia article "Handelsreizigersprobleem" in Dutch language version.

refsWebsite

Global rank Dutch rank

3web.archive.org

1^st place

1^st place

3,153^rd place

7,569^th place

uwaterloo.ca

math.uwaterloo.ca

(en) Optimal Tour of Sweden. Gearchiveerd op 26 februari 2023.
Sweden Computation. math.uwaterloo.ca. Gearchiveerd op 29 oktober 2021. Geraadpleegd op 8 juni 2023. “The cumulative CPU time used in the five branch-and-cut runs and in the cutting-plane procedures for the five root LPs was approximately 84.8 CPU years on a single Intel Xeon 2.8 GHz processor.”

web.archive.org

(en) Solution of a 15,112-city Traveling Salesman Problem
(en) Optimal Tour of Sweden. Gearchiveerd op 26 februari 2023.
Sweden Computation. math.uwaterloo.ca. Gearchiveerd op 29 oktober 2021. Geraadpleegd op 8 juni 2023. “The cumulative CPU time used in the five branch-and-cut runs and in the cutting-plane procedures for the five root LPs was approximately 84.8 CPU years on a single Intel Xeon 2.8 GHz processor.”