Tabu Search versus GRASP for the maximum diversity problem

4OR

Volumn 6, Issue 1, 2008, Pages 45-60

  Aringhieri, Roberto ^a   Cordone, Roberto ^a   Melzani, Yari ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

GRASP; Maximum diversity; Tabu Search

Indexed keywords

EID: 39449106669     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-007-0033-9     Document Type: Article

References (14)

1. Aiex RM, Resende MGC, Ribeiro CC (2005) Tttplots: a perl program to create time-to-target plots. Technical report TD-6HT7EL, AT & T Labs
2. Andrade PMD, Plastino A, Ochi LS, Martins SL (2003) GRASP for the maximum diversity problem. In: Proceedings of the fifth metaheuristics international conference (MIC 2003)
3. Andrade PMD, Plastino LS, Martins SL (2005) GRASP with path-relinking for the maximum diversity problem. In: Nikoletseas S (ed) Proceedings of the 4th International workshop on efficient and experimental algorithms (WEA 2005), Lecture Notes in Computer Science (LNCS), vol 3539. Springer, Heidelberg, pp 558-569
4. Dell'Amico M, Trubian M (1998) Solution of large weighted equicut problems. Eur J Oper Res 106:500-521
5. Festa P, Resende MGC (2002) GRASP: An annotated bibliography. In: Ribeiro CC, Hansen P (eds). Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 325-367
6. Ghosh JB (1996) Computational aspects of maximum diversity problem. Oper Res Lett 19:175-181
7. Glover F, Laguna M (1997) Tabu Search. Kluwer, Dordrecht
8. Glover F, Hersh G, McMillian C (1977) Selecting subset of maximum diversity. MS/IS 77-9. University of Colorado, Boulder
9. Glover F, Kuo CC, Dhir KS (1995) A discrete optimization model for preserving biological diversity. Appl Math Modelling 19(11):696-701
10. Glover F, Kuo CC, Dhir KS (1996) Integer programming and heuristic approaches to the minimum diversity problem. J Bus Manage 4(1):93-111
11. Kochenberger G, Glover F (1999) Diversity data mining. Working paper series HCES-03-99, The University of Mississipi
12. Kuo CC, Glover F, Dhir KS (1993) Analyzing and modeling the maximum diversity problem by zero-one programming. Decis Sci 24:1171-1185
13. Silva GC, Ochi LS, Martins SL (2004) Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Proceedings of the 3rd international workshop on efficient and experimental algorithms (WEA 2004), Lectures Notes on Computer Science (LNCS), vol 3059. Springer, Heidelberg, pp 498-512
14. Weitz R, Lakshminarayanan S (1998) An empirical comparison of heuristic methods for creating maximally diverse group. J Oper Res Soc 49:635-646