{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T11:04:27Z","timestamp":1744974267789,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/cec.2014.6900294","type":"proceedings-article","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T17:35:57Z","timestamp":1412012157000},"page":"1714-1720","source":"Crossref","is-referenced-by-count":2,"title":["Ant Colony Optimization and hypergraph covering problems"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Pat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2016570"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03751-1_6"},{"key":"18","first-page":"1393","article-title":"Ant colony optimization and the minimum cut problem","author":"k\ufffdtzing","year":"2010","journal-title":"Proc Genetic and Evolutionary Computation (GECCO"},{"key":"15","first-page":"153","article-title":"Ant colony optimization and the minimum spanning tree problem","author":"neumann","year":"2007","journal-title":"Proc Learn Intell Optimization-LION 2 LNCS Vol 5313"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.08.013"},{"key":"13","first-page":"61","article-title":"Comparing variants of MMAS ACO algo-rithms on pseudo-boolean functions","author":"neumann","year":"2007","journal-title":"Proc Stoch Local Search Algorithms (SLS'07) LNCS 4638 Brussels Belgium Springer-Verlag"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-007-9047-1"},{"key":"11","first-page":"618","article-title":"Runtime analysis of a simple ant colony optimization algorithm","author":"neumann","year":"2006","journal-title":"Proc 17th Int Symp Algorithms Comput ( ISAAC) Kolkata India LNCS Vol 4288"},{"key":"12","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1016\/j.cor.2006.12.017","article-title":"First steps to the runtime complexity analysis of ant colony optimization","volume":"35","author":"gutjahr","year":"2008","journal-title":"Comput Oper Res"},{"journal-title":"Computational Complexity of Evolutionary Algorithms Hybridizations and Swarm Intelligence","year":"2008","author":"sudholt","key":"21"},{"key":"20","first-page":"324","article-title":"Theoretical properties of two ACO approaches for the traveling salesman problem","volume":"6234","author":"k\ufffdtzing","year":"2010","journal-title":"Proc of ANTS'2010 LNCS"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_22"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2004.11.002"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/780627.780629"},{"journal-title":"Approximating Vertex Cover in Dense Hypergraphs","year":"2010","author":"cardinal","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0872"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_31"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1276964"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424512"},{"key":"1","article-title":"The ant system: An autocatalytic optimizing process","author":"dorigo","year":"1991","journal-title":"Dipartimento di Elettronica Politecnico di Milano"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.01.005"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00044-3"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802444"},{"journal-title":"Approximation Algorithms for Independent Set Problems on Hypergraphs","year":"2009","author":"losievskaja","key":"31"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0001-1"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"}],"event":{"name":"2014 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2014,7,6]]},"location":"Beijing, China","end":{"date-parts":[[2014,7,11]]}},"container-title":["2014 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6880677\/6900223\/06900294.pdf?arnumber=6900294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T17:24:33Z","timestamp":1498152273000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6900294\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/cec.2014.6900294","relation":{},"subject":[],"published":{"date-parts":[[2014,7]]}}}