메뉴 건너뛰기




Volumn 3059, Issue , 2004, Pages 498-512

Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 24944501526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_37     Document Type: Article
Times cited : (50)

References (12)
  • 1
    • 0036566527 scopus 로고    scopus 로고
    • Probability distribution of solution time in GRASP: An experimental investigation
    • Aiex, R. M., Resende, M. G. C., Ribeiro, C. G.: Probability distribution of solution time in GRASP: an experimental investigation, Journal of Heuristics, 8 (2002), 343-373
    • (2002) Journal of Heuristics , vol.8 , pp. 343-373
    • Aiex, R.M.1    Resende, M.G.C.2    Ribeiro, C.G.3
  • 3
    • 0034165530 scopus 로고    scopus 로고
    • Maximing workforce diversity in project teams: A network flow approach
    • Bhadury J., Joy Mighty E., Damar, H.: Maximing workforce diversity in project teams: a network flow approach, Omega, 28 (2000), 143-153
    • (2000) Omega , vol.28 , pp. 143-153
    • Bhadury, J.1    Joy Mighty, E.2    Damar, H.3
  • 5
    • 0030263520 scopus 로고    scopus 로고
    • Computational aspects of maximum diversity problem
    • Ghosh, J. B.: Computational aspects of maximum diversity problem, Operations Research Letters 19 (1996), 175-181
    • (1996) Operations Research Letters , vol.19 , pp. 175-181
    • Ghosh, J.B.1
  • 6
    • 24944459188 scopus 로고
    • Selecting subsets of maximum diversity
    • University of Colorado at Boulder
    • Glover, F., Hersh, G., McMillan C.: Selecting subsets of maximum diversity, MS/IS Report No. 77-9, University of Colorado at Boulder, (1977)
    • (1977) MS/IS Report No. 77-9
    • Glover, F.1    Hersh, G.2    McMillan, C.3
  • 7
    • 0342986622 scopus 로고    scopus 로고
    • Integer programming and heuristic approaches to the minimum diversity problem
    • Glover, F., Kuo, C-C., Dhir,K. S.: Integer programming and heuristic approaches to the minimum diversity problem, Journal of Business and Management 4(1), (1996), 93-111
    • (1996) Journal of Business and Management , vol.4 , Issue.1 , pp. 93-111
    • Glover, F.1    Kuo, C.-C.2    Dhir, K.S.3
  • 9
    • 35048848896 scopus 로고    scopus 로고
    • An evolutionary approach for the maximum diversity problem
    • Department of Information and Computer Engineering, Okayama University of Science
    • Katayama, K., Naribisa, H.: An evolutionary approach for the maximum diversity problem, Working Paper, Department of Information and Computer Engineering, Okayama University of Science, (2003)
    • (2003) Working Paper
    • Katayama, K.1    Naribisa, H.2
  • 10
    • 24944529379 scopus 로고    scopus 로고
    • Diversity data mining
    • The University of Mississipi
    • Kochenberger, G., Glover, F.: Diversity data mining, Working Paper, The University of Mississipi, (1999)
    • (1999) Working Paper
    • Kochenberger, G.1    Glover, F.2
  • 11
    • 0013132075 scopus 로고    scopus 로고
    • Reactive GRASP: An aplication to a matrix decomposition problem in TDMA traffic assignment
    • Prais, M., Ribeiro, C. C.: Reactive GRASP: an aplication to a matrix decomposition problem in TDMA traffic assignment, INFORMS Journal on Computing 12 (2000), 164-176
    • (2000) INFORMS Journal on Computing , vol.12 , pp. 164-176
    • Prais, M.1    Ribeiro, C.C.2
  • 12
    • 0032094794 scopus 로고    scopus 로고
    • An empirical comparison of heuristic methods for creating maximally diverse group
    • Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse group, Journal of the operational Research Society 49 (1998), 635-646
    • (1998) Journal of the Operational Research Society , vol.49 , pp. 635-646
    • Weitz, R.1    Lakshminarayanan, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.