Changes between Version 4 and Version 5 of Documentation/Reference/Robust Taboo Search
 Timestamp:
 07/25/11 13:21:32 (9 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Documentation/Reference/Robust Taboo Search
v4 v5 2 2 = Robust Taboo Search = 3 3 == Introduction == 4 This algorithm was first described in [ #Tai91 [Tai91]]. It is among the most cited algorithms to solve instances of the quadratic assignment problem (QAP).4 This algorithm was first described in [ [#Tai91 Tai91] ]. It is among the most cited algorithms to solve instances of the quadratic assignment problem (QAP). 5 5 6 6 There are two main differences to a "standard" tabu search: … … 34 34 35 35 == References == 36 [ =#Tai91 [Tai91]] Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443455.36 [ [=#Tai91 Tai91] ] Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443455.