Conference paper assignment using a combined greedy/evolutionary algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3242, Issue , 2004, Pages 602-611

  Merelo Guervós, Juan Julián ^a   Castillo Valdivieso, Pedro ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

CONFERENCE PAPERS; CONFLICTS OF INTEREST; GREEDY ALGORITHMS; PAPER FINISH;

ALGORITHMS;

EID: 35048824460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_61     Document Type: Article

References (13)

1. Ron Weber. The journal review process: a manifesto for change. Commun. AIS, 2(2es):3, 1999.
2. Scott C. Deervvester, Susan T. Dumais, Thomas K. Landauer, George W. Furnas, and Richard A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
3. Zvi Galil. Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv., 18(I):23-38, 1986.
4. P. Collet, E. Lutton, M. Schoenauer, and J. Louchet. Take it EASEA. In Marc Schoenauer, Kalyanmoy Deb, Guenter Rudolph, Xin Yao, and Hans-Paul Schwefel Evelyne Lutton, Juan Julian Merelo, editors, PPSN VI, number 1917 in LNCS, pages 891-901. Springer Verlag, 2001.
5. Juan-Julián Merelo-Guervós, Prancisco-Javier García-Castellano, P.A. Castillo, and M.G. Arenas. How Evolutionary Computation and Perl saved my conference. In Luciano Sánchez, editor, MAEB03, Segundo Congreso Espanol sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados, pages 93-99, Febrero 2003.
6. J.-J. Merelo Guervós, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacanas, and H.-P. Schwefel, editors. Parallel Problem Solving from Nature - PPSN VII, 7th International Conference, Granada, Spain, September 7-11, 2002. Proceedings, number 2439 in Lecture Notes in Computer Science, LNCS. Springer-Verlag, September 2002. Available from Amazon and http://www.springeronline.com/sgw/cda/ frontpage/0,10735,5-40109-22-2240086-0, 00.html.
7. Marc Schoenauer, Kalyanmoy Deb, Günter Rudolph, Xin Yao, Evelyne Lutton, Juan Julián Merelo, and Hans-Paul Schwefel, editors. Parallel Problem Solving from Nature - PPSN VI, number 1917 in Lecture Notes in Computer Science. Springer, 2000. Available from http://www.springeronline.com/sgw/cda/ frontpage/0,10735,5-146-22-2040755-0,00.html and Amazon.
8. Susan T. Dumais and Jakob Nielsen. Automating the assignment of submitted manuscripts to reviewers. In Research and Development in Information Retrieval, pages 233-244, 1992.
9. D. Yarowsky and R. Florian. Taking the load off the conference chairs: towards a digital paper-routing assistant. In Proceedings of the 1999 Joint SIGDAT Conference on Empirical Methods in NLP and Very-Large Corpora, 1999.
10. Jerry Cheyung Wei; D. Hartvigsen and R. Czuchlewski. The conference paperreviewer assignment problem. Decision Sciences, 30(3), 1999.
11. Christian Bierwirth, Dirk C. Mattfeld, and Herbert Kopfer. On permutation representations for scheduling problems. In Hans-Michael Voigt, Werner Ebeling, Ingo Rechenberg, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature - PPSN IV, pages 310-318, Berlin, 1996. Springer.
12. W. H. Ip; Min Huang; K. L. Yung; Dingwei Wang. Genetic algorithmnext term solution for a risk-based partner selection problem in a virtual enterprise. Computers & Operations Research, 30(2), February 2003,. Available online 26 November 2001.
13. I. M. Oliver, D.J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the traveling salesman problem. In Procs. ICGA-87, pages 224-230, 1987.