From Daan
MeesterDaan (talk | contribs) m (MeesterDaan moved page CheesemanTSPReplication to Where the Really Hard Problems Aren't) |
MeesterDaan (talk | contribs) |
||
Line 3: | Line 3: | ||
− | |||
− | |||
− | |||
Line 28: | Line 25: | ||
Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment. | Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment. | ||
+ | |||
+ | |||
+ | |||
+ | ==Interactive Results== | ||
+ | |||
+ | Here are some [https://travelingsalesman.nl/ interactively viewable results]. | ||
+ | |||
Revision as of 12:15, 1 December 2020
Page dedicated to "Where the Really Hard Problems Aren't"
Papers
Here is our paper Where the Really Hard Problems Aren't.
Here is Cheeseman et al.'s paper on instance hardness..
Here is Little et al.'s paper on branch and bound for TSP..
Here is a refurbished version of Little et al.'s paper on branch and bound for TSP..
Resources
Here is the source code for our implementation of Little's algorithm.
Here are the randomly generated source matrices used in our replicative experiment.
Interactive Results
Here are some interactively viewable results.