{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T21:52:13Z","timestamp":1759701133910},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77345-0_22","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T00:53:06Z","timestamp":1195865586000},"page":"347-363","source":"Crossref","is-referenced-by-count":15,"title":["Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"\u00dclker","sequence":"first","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]},{"given":"Emin Erkan","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C. Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: Variable neighborhood search for graph coloring. European Journal of Operational Research\u00a0151, 379\u2013388 (2003)","journal-title":"European Journal of Operational Research"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color vertices of a graph. Communications of the ACM\u00a022, 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1996","unstructured":"Burke, E.K., Newall, J., Weare, R.F.: A memetic algorithm for university exam timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol.\u00a01153, pp. 241\u2013250. Springer, Heidelberg (1996)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"Algorithm Engineering","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., Italiano, G.F.: New algorithms for examination timetabling. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 230\u2013241. Springer, Heidelberg (2001)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/palgrave.jors.0470305","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G., Lee, S.T.: Examination timetabling: algorithmic strategies and applications. Journal of the Operational Research Society\u00a047, 373\u2013383 (1996)","journal-title":"Journal of the Operational Research Society"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-30076-2_22","volume-title":"Data Warehousing and Knowledge Discovery","author":"J. Du","year":"2004","unstructured":"Du, J., Korkmaz, E., Alhajj, R., Barker, K.: Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: Kambayashi, Y., Mohania, M.K., W\u00f6\u00df, W. (eds.) DaWaK 2004. LNCS, vol.\u00a03181, pp. 219\u2013233. Springer, Heidelberg (2004)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing\u00a05, 691\u2013703 (1976)","journal-title":"SIAM Journal of Computing"},{"key":"22_CR8","volume-title":"Genetic Algorithms and Grouping Problems","author":"E. Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, New York (1998)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research\u00a063, 437\u2013461 (1996)","journal-title":"Annals of Operations Research"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03, 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"22_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"22_CR12","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989)"},{"key":"22_CR13","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., De Werra, D.: Using tabu search techniques for graph coloring. Computing\u00a039, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"22_CR15","series-title":"IEEE World Congress on Computational Intelligence","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/ICEC.1994.350037","volume-title":"Proceedings of the First IEEE Conference on Evolutionary Computation","author":"J. Horn","year":"1994","unstructured":"Horn, J., Nafpliotis, N., Goldberg, D.E.: A niched Pareto genetic algorithm for multiobjective optimization. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, vol.\u00a01, pp. 82\u201387. IEEE, Piscataway, NJ (1994)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R, McGeoch, L.A, Schevon, C.: Optimization by simulated annealing: an experimental evaluation: Part II, graph coloring and number partitioning. Operations Research\u00a039, 378\u2013406 (1991)","journal-title":"Operations Research"},{"key":"22_CR17","volume-title":"Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"D.S. Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. American Mathematical Society, Providence, RI (1996)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Kirovski, D., Potkonjak, M.: Efficient coloring of a large spectrum of graphs. In: 35th Design Automation Conference Proceedings, pp. 427\u2013432 (1998)","DOI":"10.1145\/277044.277165"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards\u00a084, 79\u2013100 (1979)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"22_CR20","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, Gent, pp. 348\u2013371 (August 2002)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Ozcan, E., Ersoy, E.: Final exam scheduler \u2013 FES. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, vol.\u00a02, pp. 1356\u20131363 (2005)","DOI":"10.1109\/CEC.2005.1554848"},{"key":"22_CR22","unstructured":"Paquete, L.F., Fonseca, C.M.: A study of examination timetabling with multiobjective evolutionary algorithms. In: Proceedings of the 4th Metaheuristics International Conference, MIC, Porto, pp. 149\u2013154 (2001)"},{"key":"22_CR23","unstructured":"Radcliffe, N.J.: Formal analysis and random respectful recombination. In: Proceedings of the 4th International Conference on Genetic Algorithms, pp. 222\u2013229 (1991)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Ramani, A., Aloul, F.A., Markov, I., Sakallah, K.A.: Breaking instance-independent symmetries in exact graph coloring. In: Design Automation and Test Conference in Europe, pp. 324\u2013329 (2004)","DOI":"10.1109\/DATE.2004.1268868"},{"key":"22_CR25","unstructured":"Terashima-Mar\u00edn, H., Ross, P., Valenzuela-Rend\u00f3n, M.: Clique-based crossover for solving the timetabling problem with gas. In: Proceedings of the Congress on Evolutionary Computation, pp. 1200\u20131206 (1999)"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Wong, T., Cote, P., Gely, P.: Final exam timetabling: a practical approach. In: Canadian Conference on Electrical and Computer Engineering, Winnipeg, vol.\u00a02, pp. 726\u2013731 (2002)","DOI":"10.1109\/CCECE.2002.1013031"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77345-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:08:59Z","timestamp":1619507339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_22","relation":{},"subject":[]}}