Changes between Version 8 and Version 9 of Documentation/Reference/Robust Taboo Search

Timestamp:

07/25/11 23:29:07 (13 years ago)

Author:

abeham

Comment:

--

Documentation/Reference/Robust Taboo Search

@@ -2 +2 @@
 = Robust Taboo Search =
 == Introduction ==
-This algorithm was first described in [#Tai91 |Tai91|]. It is among the most cited algorithms to solve instances of the quadratic assignment problem (QAP).
+This algorithm was first described in [#Tai91 Tai91]. It is among the most cited algorithms to solve instances of the quadratic assignment problem (QAP).
 
 There are two main differences to a "standard" tabu search:
@@ -34 +34 @@
 
 == References ==
-|[=#Tai91 Tai91]| Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443-455.
+[=#Tai91 Tai91] - Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443-455.