{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:32:56Z","timestamp":1730251976092,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icnc.2011.6022440","type":"proceedings-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T20:25:13Z","timestamp":1318451113000},"page":"2179-2183","source":"Crossref","is-referenced-by-count":4,"title":["Obstacle-avoiding rectilinear Steiner minimum tree construction based on Discrete Particle Swarm Optimization"],"prefix":"10.1109","author":[{"given":"Yulong","family":"Shen","sequence":"first","affiliation":[]},{"given":"Qingzhen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"742","article-title":"Neuer beweis eines satzes uber permutationen","volume":"27","author":"pru?fer","year":"1918","journal-title":"Arch Math"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-009-0501-6"},{"key":"18","first-page":"323","article-title":"A discrete particle swarm optimization algorithm for the multiobjective permutation flow-shop sequencing problem","author":"guo","year":"2007","journal-title":"Proceedings of the Second International Conference of Fuzzy Information and Engineering"},{"key":"15","first-page":"2460","article-title":"A novel particle swarm optimization for the steiner tree problem in graphs","author":"zhong","year":"2008","journal-title":"IEEE World Congress on Evolutionary Computation"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICICISYS.2009.5358030"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687405"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654220"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/43.144853"},{"journal-title":"The Steiner Tree Problem Annals of Discrete Mathematics","year":"1992","author":"hwang","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2096571"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1231996.1232023"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.45"},{"key":"5","article-title":"CDC tree: Novel obstacle-avoiding routing tree construction based on current driven circuit model","author":"shi","year":"2006","journal-title":"Proceedings ASP-DAC"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2005.1466120"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006098"},{"key":"8","first-page":"523","article-title":"Obstacle-avoiding rectilinear steiner tree construction","author":"li","year":"2008","journal-title":"Proc Int Conf Comput -Aided Des"}],"event":{"name":"2011 Seventh International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2011,7,26]]},"location":"Shanghai, China","end":{"date-parts":[[2011,7,28]]}},"container-title":["2011 Seventh International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6012803\/6022384\/06022440.pdf?arnumber=6022440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T05:02:21Z","timestamp":1490072541000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6022440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icnc.2011.6022440","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}