{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:32:39Z","timestamp":1742938359356,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226052"},{"type":"electronic","value":"9783642226069"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22606-9_17","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:36:44Z","timestamp":1312893404000},"page":"135-145","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient EA with Multipoint Guided Crossover for Bi-objective Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Soma","family":"Saha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyan","family":"Baboo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. Burke","year":"2002","unstructured":"Burke, E., Petrovic, S.: Recent research directions in automated timetabling. European J. operation research\u00a0140(2), 266\u2013280 (2002)","journal-title":"European J. operation research"},{"key":"17_CR2","unstructured":"Davis, T.: The mathematics of sudoku (2010), http:\/\/www.geometer.org\/mathcircles\/sudoku.pdf"},{"issue":"10","key":"17_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"23","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., So, H.C.: An application of graph coloring to printed circuit testing. IEEE Transactions on Circuits and Systems\u00a023(10), 591\u2013599 (1976)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, NY (1972)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Computer and System Sciences\u00a057(2), 187\u2013199 (1998)","journal-title":"J. Computer and System Sciences"},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing\u00a03(6), 103\u2013128 (2007)","journal-title":"Theory of Computing"},{"issue":"4","key":"17_CR7","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 the vertices of a graph. Commun. ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20035","volume":"44","author":"M. Caramia","year":"2004","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Bounding vertex coloring by truncated multistage branch and bound. Networks\u00a044(4), 231\u2013242 (2004)","journal-title":"Networks"},{"issue":"4","key":"17_CR9","first-page":"344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. J. Computing (JOC)\u00a08(4), 344\u2013354 (1996)","journal-title":"J. Computing (JOC)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/TEMC.1977.303601","volume":"19","author":"J. Zoellner","year":"1977","unstructured":"Zoellner, J., Beall, C.: A breakthrough in spectrum conserving frequency assignment technology. IEEE Trans. Electromag. Compact.\u00a019(3), 313\u2013319 (1977)","journal-title":"IEEE Trans. Electromag. Compact."},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D.W. Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM\u00a030(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"17_CR12","first-page":"113","volume-title":"Proc. Evolutionary Algorithms in Engineering and Computer Science (EU-ROGEN)","author":"A. Marino","year":"1999","unstructured":"Marino, A., Prugel-Bennett, A., Glass, C.A.: Improving graph coloring with lin-ear programmng and genetic algorithms. In: Miettinen, K., Makela, M., Toivanen, J. (eds.) Proc. Evolutionary Algorithms in Engineering and Computer Science (EU-ROGEN), Jyvaskyld, Finland, pp. 113\u2013118. John Wiley & Sons, Chichester (1999)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Al-Omari, H., Sabri, K.E.: New graph coloring algorithms. J. Mathematics and Statistics, 739\u2013741 (2006)","DOI":"10.3844\/jmssp.2006.439.441"},{"key":"17_CR14","unstructured":"Croitoru, C., Luchian, H., Gheorghies, O., Apetrei, A.: A new genetic graph coloring heuristic. In: Computational Symphosium on Graph Coloring and its Generalizations, pp. 63\u201374 (2002)"},{"key":"17_CR15","first-page":"30","volume-title":"Proc. Int. Conf. Computational Intelligence, Theory and Applications","author":"N. Drechsler","year":"1999","unstructured":"Drechsler, N., Gunther, W., Drechsler, R.: Efficient graph coloring by evolutionary algorithms. In: Reusch, B. (ed.) Proc. Int. Conf. Computational Intelligence, Theory and Applications, pp. 30\u201339. Springer, London (1999)"},{"issue":"4","key":"17_CR16","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. J. Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"J. Combinatorial Optimization"},{"key":"17_CR17","first-page":"3","volume-title":"Proc. Int. Conf. Computer Modeling and Simulation","author":"L. Han","year":"2010","unstructured":"Han, L., Han, Z.: A novel bi-objective genetic algorithm for the graph coloring problem. In: Proc. Int. Conf. Computer Modeling and Simulation, Sanya, Chaina, pp. 3\u20136. IEEE Press, India (2010)"},{"key":"17_CR18","first-page":"717","volume-title":"Proc. Int. Conf. Computer Supported Cooperative Work in Design","author":"F. Huang","year":"2004","unstructured":"Huang, F., Chen, G.: A symmetry-breaking approach of the graph coloring problem with gas. In: Miettinen, K., Makela, M.M., Toivanen, J. (eds.) Proc. Int. Conf. Computer Supported Cooperative Work in Design, pp. 717\u2013719. IEEE Press, Xiamen (2004)"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/1389095.1389203","volume-title":"Proc. Genetic and Evolutionary Computation Conference (GECCO)","author":"R. Kumar","year":"2008","unstructured":"Kumar, R., Tolay, P., Tiwary, S.: Enhancing solution quality of the biobjective graph coloring problem using hybridization of EA. In: K\u00f6ppen, M., et al. (eds.) Proc. Genetic and Evolutionary Computation Conference (GECCO), pp. 547\u2013554. ACM Press, Atlanta (2008)"},{"key":"17_CR20","unstructured":"Eiben, A.E., van der Hauw, J.K.: Graph coloring with adaptive genetic algorithms. Technical Report TR 96-11, Leiden University (1996)"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A. Jazkiewicz","year":"2002","unstructured":"Jazkiewicz, A.: Genetic local search for multiobjective combinatorial optimization. European J. Operational Research\u00a0137(1), 50\u201371 (2002)","journal-title":"European J. Operational Research"},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"17_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q. Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation\u00a011(6), 712\u2013731 (2007)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"17_CR24","first-page":"13","volume-title":"Proc. Simulated Evolution And Learning (SEAL)","author":"K. Deb","year":"2002","unstructured":"Deb, K., Jain, S.: Running performance metrics for evolutionary multiobjective optimization. In: Wang, L., Tan, K.C., Furuhashi, T., Kim, J.H., Yao, X. (eds.) Proc. Simulated Evolution And Learning (SEAL), Orchid Country Club, Singapore, pp. 13\u201320. ACM Press, New York (2002)"},{"key":"17_CR25","volume-title":"Multi-Objective Optimization using Evolutionary Algorithms.","author":"K. Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)"},{"key":"17_CR26","unstructured":"Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, Swiss Federal Institute of Technology Zurich (1999)"},{"key":"17_CR27","first-page":"711","volume-title":"Proc. Congress Evolutionary Computation (CEC)","author":"J.D. Knowles","year":"2002","unstructured":"Knowles, J.D., Corne, D.W.: On metrics for comparing nondominated sets. In: Proc. Congress Evolutionary Computation (CEC), Honolulu, Hawaii, pp. 711\u2013716. IEEE Press, Los Alamitos (2002)"}],"container-title":["Communications in Computer and Information Science","Contemporary Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22606-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T01:36:24Z","timestamp":1638236184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22606-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226052","9783642226069"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22606-9_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}