From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) (→Papers) |
||
Line 9: | Line 9: | ||
==Papers== | ==Papers== | ||
+ | |||
+ | Here is our paper [https://www.sciencedirect.com/science/article/pii/S2214716020300506 Where the Really Hard Problems Aren't.] | ||
Line 18: | Line 20: | ||
Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.]. | Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a refurbished version of Little et al.'s paper on branch and bound for TSP.]. | ||
− | |||
==Resources== | ==Resources== |
Revision as of 12:13, 1 December 2020
Page dedicated to "Where the Really Hard Problems Aren't"
Interactive Results
Here are some interactively viewable results.
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.