From Daan

MeesterDaan (talk | contribs) (Created page with " Page dedicated to "Where the Really Hard Problems Aren't" Here are the [http://www.heuristieken.nl/resources/Cheeseman&Little.zip Papers by Cheeseman et al, little et al].") |
MeesterDaan (talk | contribs) |
||

(5 intermediate revisions by the same user not shown) | |||

Line 2: | Line 2: | ||

Page dedicated to "Where the Really Hard Problems Aren't" | Page dedicated to "Where the Really Hard Problems Aren't" | ||

+ | ==Papers== | ||

− | Here | + | Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.]. |

+ | |||

+ | |||

+ | Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-AlgorithmforTSP.pdf 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== | ||

+ | |||

+ | |||

+ | Here is [http://www.heuristieken.nl/resources/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm. | ||

+ | |||

+ | |||

+ | Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment. |

## Latest revision as of 23:57, 7 October 2019

Page dedicated to "Where the Really Hard Problems Aren't"

## 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.