{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:09Z","timestamp":1750306929047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MEC","award":["TIN2009-14312-C02-01, TIN2012-39391-C04-04"],"award-info":[{"award-number":["TIN2009-14312-C02-01, TIN2012-39391-C04-04"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2480362.2480403","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"194-199","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Using polynomial reductions to test the suitability of metaheuristics for solving NP-complete problems"],"prefix":"10.1145","author":[{"given":"Pablo","family":"Rabanal","sequence":"first","affiliation":[{"name":"Universidad Complutense de Madrid, Madrid, Spain"}]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Universidad Complutense de Madrid, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A. Benjamin. Genetic algorithms and the Traveling Salesman Problem. Annals of Operations Research 63(December):337--370 2000.  A. Benjamin. Genetic algorithms and the Traveling Salesman Problem. Annals of Operations Research 63(December):337--370 2000.","DOI":"10.1007\/BF02125403"},{"key":"e_1_3_2_1_3_1","first-page":"25","article-title":"A new rank based version of the ant system - a computational study","volume":"7","author":"Bullnheimer B.","year":"1997","journal-title":"Central European Journal for Operations Research and Economics"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"R.\n       \n      Chiong editor. \n  Nature-Inspired Algorithms for Optimisation volume \n  193\n   of \n  Studies in Computational Intelligence\n  . \n  Springer 2009\n  .   R. Chiong editor. Nature-Inspired Algorithms for Optimisation volume 193 of Studies in Computational Intelligence . Springer 2009.","DOI":"10.1007\/978-3-642-00267-0"},{"key":"e_1_3_2_1_5_1","unstructured":"S. Cook. The P versus NP problem 2000. Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems.  S. Cook. The P versus NP problem 2000. Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1388969.1389054"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/975277"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/954563"},{"volume-title":"Optimisation and Machine Learning. Addison-Wesley","year":"1989","author":"Goldberg D. E.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","first-page":"283","volume-title":"SAT 2000","author":"Hoos H. H.","year":"2000"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-58495-1_14","volume-title":"Methodologies for Intelligent Systems","author":"Michalewicz Z.","year":"1994"},{"volume-title":"Addison-Wesley","year":"1994","author":"Papadimitriou C. M.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646686.702796"},{"key":"e_1_3_2_1_15_1","unstructured":"P. Rabanal and I. Rodr\u00edguez. Appendix: Polynomial reductions (VC to SP MAX-3SAT to MC and TSP to KN). http:\/\/antares.sip.ucm.es\/prabanal\/research\/sac13appendix.pdf 2012.  P. Rabanal and I. Rodr\u00edguez. Appendix: Polynomial reductions (VC to SP MAX-3SAT to MC and TSP to KN). http:\/\/antares.sip.ucm.es\/prabanal\/research\/sac13appendix.pdf 2012."},{"key":"e_1_3_2_1_16_1","first-page":"163","volume-title":"UC'07","author":"Rabanal P.","year":"2007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"P.\n       \n      Rabanal I.\n       \n      Rodr\u00edguez and \n      \n      \n      F.\n       \n      Rubio\n      \n  \n  . \n  Applying river formation dynamics to solve NP-complete problems. In R. Chiong editor Nature-Inspired Algorithms for Optimisation volume \n  193\n   of \n  Studies in Computational Intelligence pages \n  333\n  --\n  368\n  . \n  Springer 2009\n  .  P. Rabanal I. Rodr\u00edguez and F. Rubio. Applying river formation dynamics to solve NP-complete problems. In R. Chiong editor Nature-Inspired Algorithms for Optimisation volume 193 of Studies in Computational Intelligence pages 333--368. Springer 2009.","DOI":"10.1007\/978-3-642-00267-0_12"},{"key":"e_1_3_2_1_18_1","first-page":"1","volume-title":"Formal Aspects of Computing","author":"Rabanal P.","year":"2012"},{"key":"e_1_3_2_1_19_1","unstructured":"G. Reinelt. TSPLIB. Technical report Institut f\u00fcr Informatik Universit\u00e4t Heidelberg 2008. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/.  G. Reinelt. TSPLIB. Technical report Institut f\u00fcr Informatik Universit\u00e4t Heidelberg 2008. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/."},{"key":"e_1_3_2_1_20_1","first-page":"118","volume-title":"Proceedings of the International Joint Conference on Neural Networks","author":"Spears W. M.","year":"1990"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"}],"event":{"name":"SAC '13: SAC '13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Coimbra Portugal","acronym":"SAC '13"},"container-title":["Proceedings of the 28th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480362.2480403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:32Z","timestamp":1750235732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":21,"alternative-id":["10.1145\/2480362.2480403","10.1145\/2480362"],"URL":"https:\/\/doi.org\/10.1145\/2480362.2480403","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}