메뉴 건너뛰기




Volumn 39, Issue , 2007, Pages 113-134

Reviewer assignment for scientific articles using memetic algorithms

Author keywords

Assignment problem; Memetic algorithm

Indexed keywords


EID: 84888598445     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-71921-4_6     Document Type: Article
Times cited : (11)

References (19)
  • 2
    • 0002035566 scopus 로고
    • Reducing Bias and Inefficiency in the Selection Algorithm
    • In: Grefenstette, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1987
    • Baker, J. E. (1987): "Reducing Bias and Inefficiency in the Selection Algorithm. " In: Grefenstette, J. J.: Proceedings of the Second International Conference on Genetic Algorithms and their Application, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1987, 14-21.
    • (1987) Proceedings of the Second International Conference on Genetic Algorithms and their Application , pp. 14-21
    • Baker, J.E.1
  • 4
    • 0030735527 scopus 로고    scopus 로고
    • A genetic algorithm for the generalized assignment problem
    • Chu, P. C.; Beasley, J. E. (1997): "A genetic algorithm for the generalized assignment problem. " Computational Operations Research 24, 17-23.
    • (1997) Computational Operations Research , vol.24 , pp. 17-23
    • Chu, P.C.1    Beasley, J.E.2
  • 5
    • 0015330635 scopus 로고
    • Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
    • Edmonds, Jack; Karp, Richard M. (1972): "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. " In: Journal of the Association for Computing Machinery, Vol. 19, No. 2, 248-264.
    • (1972) In: Journal of the Association for Computing Machinery , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2
  • 6
    • 0033358232 scopus 로고    scopus 로고
    • A new scaling algorithm for the minimum cost network flow problem
    • Elsevier Science B. V
    • Goldfarb, Donald; Jin, Zhiying (1999): "A new scaling algorithm for the minimum cost network flow problem. " In: Operations Research Letters 25, Elsevier Science B. V., 205-211.
    • (1999) In: Operations Research Letters , vol.25 , pp. 205-211
    • Goldfarb, D.1    Jin, Z.2
  • 7
    • 0003590794 scopus 로고    scopus 로고
    • Combinatorial Optimization: Theory and Algorithms
    • Springer
    • Korte, B.; Vygen, J. (2006): "Combinatorial Optimization: Theory and Algorithms. " 3rd Edition, Springer, 191-214.
    • (2006) 3rd Edition , pp. 191-214
    • Korte, B.1    Vygen, J.2
  • 9
    • 3843110331 scopus 로고    scopus 로고
    • Adaptive search heuristics for the generalized assignment problem
    • Lourenco, H. R.; Serra, D. (2002): "Adaptive search heuristics for the generalized assignment problem. " Mathware Soft Computing 9, 209-234.
    • (2002) Mathware Soft Computing , vol.9 , pp. 209-234
    • Lourenco, H.R.1    Serra, D.2
  • 11
    • 0242655516 scopus 로고    scopus 로고
    • A Gentle Introduction To Memetic Algorithms
    • In: Glover, Fred, and Kochenberger, Gary A. (eds.):, (International Series in Operations Research & Management Science,). Kluwer Academic Publishers, Boston, USA
    • Moscato, P.; Cotta, C. (2003): "A Gentle Introduction To Memetic Algorithms. " In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 105-144.
    • (2003) Handbook of Metaheuristics , vol.57 , pp. 105-144
    • Moscato, P.1    Cotta, C.2
  • 12
    • 3843079596 scopus 로고    scopus 로고
    • Solving the generalized assignment problem: An optimizing and heuristic approach
    • Nauss, R. M. (2003): "'Solving the generalized assignment problem: An optimizing and heuristic approach"'. INFORMS Journal on Computing 15, 249-266.
    • (2003) INFORMS Journal on Computing , vol.15 , pp. 249-266
    • Nauss, R.M.1
  • 13
    • 0027554501 scopus 로고
    • A faster strongly polynomial minimum cost flow algorithm
    • Orlin, J. B. (1993): "A faster strongly polynomial minimum cost flow algorithm. " In: Operations Research, Vol. 41, Issue 2, 338-350.
    • (1993) Operations Research , vol.41 , Issue.2 , pp. 338-350
    • Orlin, J.B.1
  • 14
    • 34249754951 scopus 로고
    • Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches
    • Osman, I. H. (1995): "Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches. " OR Spektrum 17, 211-225.
    • (1995) OR Spektrum , vol.17 , pp. 211-225
    • Osman, I.H.1
  • 15
    • 0012587086 scopus 로고    scopus 로고
    • Greedy Randomized Adaptive Search Procedures
    • In: Glover, Fred, and Kochenberger, Gary A. (eds.):, (International Series in Operations Research & Management Science,). Kluwer Academic Publishers, Boston, USA
    • Resende, M. G. C.; Ribeiro, C. C. (2003): "Greedy Randomized Adaptive Search Procedures. " In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 219-249.
    • (2003) Handbook of Metaheuristics , vol.57 , pp. 219-249
    • Resende, M.G.C.1    Ribeiro, C.C.2
  • 16
    • 0031272503 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the generalized assignment problem
    • Savelsbergh, M. W. P. (1997): "A branch-and-price algorithm for the generalized assignment problem. " Operations Research 45, 831-841.
    • (1997) Operations Research , vol.45 , pp. 831-841
    • Savelsbergh, M.W.P.1
  • 17
    • 3142537983 scopus 로고    scopus 로고
    • An Ejection Chain Approach for the Generalized Assignment Problem
    • In:, (INFORMS Journal of Computing, no. 2)
    • Yagiura, M.; Ibaraki, T.; Glover, F. (2004): "An Ejection Chain Approach for the Generalized Assignment Problem. " In: INFORMS (INFORMS Journal of Computing, vol. 16, no. 2), 133-151.
    • (2004) INFORMS , vol.16 , pp. 133-151
    • Yagiura, M.1    Ibaraki, T.2    Glover, F.3
  • 18
    • 25444472683 scopus 로고    scopus 로고
    • A Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem
    • Yagiura, M.; Ibaraki, T.; Glover, F. (2006): "A Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem. " European Journal of Operational Research, 169, 548-569.
    • (2006) European Journal of Operational Research , vol.169 , pp. 548-569
    • Yagiura, M.1    Ibaraki, T.2    Glover, F.3
  • 19
    • 0002361901 scopus 로고    scopus 로고
    • A variable depth search algorithm for the generalized assignment problem
    • In: Meta-Heuristics:, Kluwer Academic Publishers, Boston, USA
    • Yagiura, M.; Yamaguchi, T.; Ibaraki, T. (1999): "A variable depth search algorithm for the generalized assignment problem. " In: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, USA, 459-471.
    • (1999) Advances and Trends in Local Search Paradigms for Optimization , pp. 459-471
    • Yagiura, M.1    Yamaguchi, T.2    Ibaraki, T.3


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