{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:55:38Z","timestamp":1730296538699,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sis.2003.1202239","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["An ant-algorithm for the weighted minimum hitting set problem"],"prefix":"10.1109","author":[{"given":"A.","family":"Cincotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Cutello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Pappalardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"656","article-title":"A study of some properties of ant-q","author":"dorigo","year":"1996","journal-title":"International Conference on Evolutionary Computation The 4th Conference on Parallel Problem Solving from Nature"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"article-title":"Computers and Intractability A guide to the theory of NP-completeness","year":"1979","author":"garey","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.3.274"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237991"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.6.1363"},{"key":"ref19","first-page":"283","article-title":"The Complexity of Sensing by Point Sampling. Algorithmic Foundations of Robotics","author":"yan-bin","year":"1995"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321556.321572"},{"key":"ref3","first-page":"24","article-title":"The ant colony methaphor for searching continous design spaces","volume":"993","author":"bilchev","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600357"},{"key":"ref5","article-title":"Distributed Optimization by Ant Colonies","author":"colorni","year":"1991","journal-title":"Proc of 3rd European Conf on Artificial Life"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45110-2_29"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006262"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167174"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.3.501"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336517"}],"event":{"name":"2003 IEEE Swarm Intelligence Symposium","acronym":"SIS-03","location":"Indianapolis, IN, USA"},"container-title":["Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8554\/27067\/01202239.pdf?arnumber=1202239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:48:04Z","timestamp":1489427284000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1202239\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/sis.2003.1202239","relation":{},"subject":[]}}