{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:49:07Z","timestamp":1755694147066},"reference-count":17,"publisher":"International Academy Publishing (IAP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.6.6.1175-1182","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T13:19:57Z","timestamp":1307107197000},"source":"Crossref","is-referenced-by-count":13,"title":["Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem"],"prefix":"10.17706","volume":"6","author":[{"given":"Jin","family":"Qin","sequence":"first","affiliation":[]},{"given":"Yi-xin","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Xiao-juan","family":"Ban","sequence":"additional","affiliation":[]}],"member":"7163","published-online":{"date-parts":[[2011,6,3]]},"reference":[{"key":"ref1","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness.","author":"Garey","year":"1997"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","article-title":"A graph coloring algorithm for large scheduling problems","volume":"84","author":"Leighton","year":"1979","journal-title":"J. Res. Natl. Bur. Stand.","ISSN":"http:\/\/id.crossref.org\/issn\/0091-0635","issn-type":"print"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.3.378"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125407"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.03.025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00832-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.022"},{"key":"ref10","first-page":"1942","article-title":"(Perth, Australia): IEEE Service Center","volume":"IV","author":"Kennedy","year":"1995","journal-title":"Piscataway, NJ"},{"key":"ref11","volume-title":"Fundamentals of computational swarm intelligence.","author":"Engelbrecht","year":"2005"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","article-title":"Discrete particle swarm optimization, illustrated by the traveling salesman problem.","volume-title":"New optimization techniques in engineering","author":"Clerc","year":"2004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00263-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.028"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T21:06:59Z","timestamp":1497906419000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/3315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,3]]},"references-count":17,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2011,6,3]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.6.6.1175-1182","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6,3]]}}}