Where the Really Hard Problems Aren't - Revision history

MeesterDaan at 12:16, 1 December 2020

2020-12-01T12:16:31Z

2020-12-01T12:15:38Z

2020-12-01T12:15:03Z

2020-12-01T12:13:31Z

‎Papers

2020-04-26T13:06:25Z

2020-04-26T13:03:02Z

2019-12-17T19:54:50Z

2019-10-07T21:57:22Z

2019-10-06T23:30:48Z

2019-10-06T23:29:56Z

@@ Line 1: / Line 1: @@
 ==Papers==
@@ Line 18: / Line 13: @@
 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/Littles-Algorithm-Sleegers-et-al.-master.zip the source code] for our implementation of Little's algorithm.
+Here are some [https://travelingsalesman.nl/ interactively viewable results].
-Here are the randomly generated [http://www.heuristieken.nl/resources/matrices.zip source matrices] used in our replicative experiment.
+==Resources==

← Older revision		Revision as of 12:15, 1 December 2020
Line 3:		Line 3:


−	~~==Interactive Results==~~
−
−	~~Here are some [https://travelingsalesman.nl/ interactively viewable results].~~


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].
		+

@@ Line 9: / Line 9: @@
 ==Papers==
@@ 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.].
 ==Resources==

@@ Line 34: / Line 34: @@
 {| 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. ]]
+|valign="bottom" |[[Image:Verschovenfasetransitie.png|thumb|upright=2.5|border| If you increase the mean, the phase transition occurs at a higher sigma. ]]
 |}
 </Center>

← Older revision		Revision as of 13:03, 26 April 2020
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>

← Older revision	Revision as of 12:15, 1 December 2020
(No difference)

@@ Line 2: / Line 2: @@
 Page dedicated to "Where the Really Hard Problems Aren't"
 Here is [http://www.heuristieken.nl/resources/(1991)CheesemanEtAl-RootPaper.pdf Cheeseman et al.'s paper on instance hardness.].
@@ Line 10: / Line 11: @@
 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.].

← Older revision		Revision as of 23:30, 6 October 2019
Line 9:		Line 9:


−	Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-_refurbished_AlgorithmforTSP.pdf a ~~refurnished~~ 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.].

← Older revision		Revision as of 23:29, 6 October 2019
Line 9:		Line 9:


−	Here is [http://www.heuristieken.nl/resources/(1963)Littleetal-~~[refurbished]AlgorithmforTSP~~.pdf a refurnished 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 refurnished version of Little et al.'s paper on branch and bound for TSP.].