Changes between Version 4 and Version 5 of Documentation/Reference/Robust Taboo Search


Ignore:
Timestamp:
07/25/11 13:21:32 (8 years ago)
Author:
abeham
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Documentation/Reference/Robust Taboo Search

    v4 v5  
    22= Robust Taboo Search =
    33== 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).
     4This algorithm was first described in [ [#Tai91 Tai91] ]. It is among the most cited algorithms to solve instances of the quadratic assignment problem (QAP).
    55
    66There are two main differences to a "standard" tabu search:
     
    3434
    3535== References ==
    36 [=#Tai91 [Tai91]] Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443-455.
     36[ [=#Tai91 Tai91] ] Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. //Parallel Computing// 17, pp. 443-455.