References
- AhujaRKErgunOOrlinJBPunnenAPA survey of very large-scale neighborhood search techniquesDisc Appl Math20021237510210.1016/S0166-218X(01)00338-9
- Andrade PMD, Plastino A, Ochi LS and Martins SL (2003). GRASP for the maximum diversity problem. In Proceedings of the Fifth Metaheuristics International Conference (MIC 2003); Kyoto, Japan.
- Aringhieri R and Cordone R (2006). Better and faster solutions for the maximum diversity problem. Note del Polo 93, Università degli Studi di Milano, Crema, April.
- AringhieriRDell'AmicoMComparing metaheuristic algorithms for SONET network design problemsJ Heurist200511355710.1007/s10732-005-6998-7
- AringhieriRDell'AmicoMSolution of the SONET ring assignment problem with capacity constraintsMetaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search200593116
- Aringhieri R, Bruglieri M, Malucelli F and Nonato M (2005). Metaheuristics for a vehicle routing problem on bipartite graphs with distance constraints. In: Proceedings of Sixth Metaheuristics International Conference. August, Wien.
- Aringhieri R, Cordone R and Melzani Y (2007). An Ant Colony Optimization approach to the maximum diversity problem. Note del Polo 109, Università degli Studi di Milano, Crema, October.
- AringhieriRCordoneRMelzaniYTabu search vs. GRASP for the maximum diversity problem4OR: Quart J Opns Res200861456010.1007/s10288-007-0033-9
- AringhieriRBruglieriMCordoneROptimal results and tight bounds for the maximum diversity problemFound Comput Decis Sci20093427385
- BrimbergJMladenovićNUroševićDNgaiEVariable neighbourhood search for the heaviest k-subgraphComp Opns Res2009362885289110.1016/j.cor.2008.12.020
- Campos V, Duarte A, Gallego M, Gortazar F, Martì R and Piñana E . (2010) Optsicom. http://heur.uv.es/optsicom/.
- CordoneRWolfler CalvoRA heuristic for the vehicle routing problem with time windowsJ Heurist2001710712910.1023/A:1011301019184
- Dell'AmicoMTrubianMSolution of large weighted equicut problemsEur J Opl Res199810650052110.1016/S0377-2217(97)00287-7
- DorigoMStützleTAnt Colony Optimization2004
- DuarteAMartìRTabu search and GRASP for the maximum diversity problemEur J Opl Res2007178718410.1016/j.ejor.2006.01.021
- EspositoAFiorenzo CatalanoMSMalucelliFTarriconeLA new matrix bandwidth reduction algorithmOpns Res Lett1998239910710.1016/S0167-6377(98)00040-6
- FestaPResendeMGCGRASP: An annotated bibliographyEssays and Surveys in Metaheuristics2002325367
- GallegoMDuarteALagunaMMartìRHybrid heuristics for the maximum diversity problemComput Optim Appl20094441142610.1007/s10589-007-9161-6
- GendreauMHertzALaporteGNew insertion and postoptimization procedures for the traveling salesman problemOpns Res1992401086109410.1287/opre.40.6.1086
- GendreauMHertzALaporteGA tabu search heuristic for the vehicle routing problemMngt Sci1994401276129010.1287/mnsc.40.10.1276
- GhoshJBComputational aspects of the maximum diversity problemOpns Res Lett19961917518110.1016/0167-6377(96)00025-9
- GloverFLagunaMTabu Search1997
- Glover F, Hersh G and McMillian C (1977). Selecting subset of maximum diversity. MS/IS 77-9, University of Colorado at Boulder.
- GloverFKuoCCDhirKSA discrete optimization model for preserving biological diversityAppl Math Modell19951969670110.1016/0307-904X(95)00083-V
- GloverFKuoCCDhirKSInteger programming and heuristic approaches to the Minimum Diversity ProblemJ Bus Mngt19964193111
- HansenPMladenovićNVariable neighbourhood search: Principles and applicationsEur J Opns Res200113044946710.1016/S0377-2217(00)00100-4
- HansenPMladenovićNVariable neighborhood searchHandbook of Metaheuristics2003145184
- KleinbergJTardosÉAlgorithm Design2006
- Kochenberger G and Glover F (1999). Title: Diversity data mining. Working Paper Series HCES-03-99, The University of Mississipi.
- KuoCCGloverFDhirKSAnalyzing and modeling the maximum diversity problem by zero-one programmingDecis Sci1993241171118510.1111/j.1540-5915.1993.tb00509.x
- LagunaMArmentanoVALessons from applying and experimenting with scatter searchMetaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search2005229246
- LagunaMMartíRScatter Search: Methodology and Implementations in C2003
- L'EcuyerPGood parameters and implementations for combined multiple recursive random number generatorsOpns Res19994715916410.1287/opre.47.1.159
- LinSKernighanBWAn effective heuristic algorithm for the traveling-salesman problemOpns Res19732149851610.1287/opre.21.2.498
- MartìRGallegoMDuarteAA branch and bound algorithm for the maximum diversity problemEur J Opl Res2010200364410.1016/j.ejor.2008.12.023
- PalubeckisGIterated tabu search for the maximum diversity problemAppl Math Comput2007189371383
- PressWHNumerical Recipes in C1990
- SantosLFRibeiroMHPlastinoAMartinsSLA hybrid GRASP with data mining for the maximum diversity problemHybrid Metaheuristics, Second International Workshop2005116127
- SilvaGCOchiLSMartinsSLExperimental comparison of greedy randomized adaptive search procedures for the Maximum Diversity ProblemProceedings of the 3rd International Workshop on Efficient and Experimental Algorithms (WEA 2004)2004498512
- SilvaGCde AndradeMRQOchiLSMartinsSLPlastinoANew heuristics for the maximum diversity problemJ Heurist20071331533610.1007/s10732-007-9010-x
- WeitzRLakshminarayananSAn empirical comparison of heuristic methods for creating maximally diverse groupsJ Opl Res Soc19984963564610.1057/palgrave.jors.2600510
- WilcoxonFIndividual comparisons by ranking methodsBiometrics19451808310.2307/3001968