From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) |
||
Line 27: | Line 27: | ||
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. | ||
+ | |||
+ | |||
+ | ==A Different Mean== | ||
+ | |||
+ | <Center> | ||
+ | {| align="center" | style=" align="center"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;" | ||
+ | |- | ||
+ | |valign="bottom" |[[Image:verschovenfasetransitie|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]] | ||
+ | |} | ||
+ | </Center> |
Revision as of 13:03, 26 April 2020
Page dedicated to "Where the Really Hard Problems Aren't"
Interactive Results
Here are some interactively viewable results.
Papers
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.