Where the Really Hard Problems Aren't

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.