{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T06:31:39Z","timestamp":1764225099275,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icnc.2011.6022221","type":"proceedings-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T20:25:13Z","timestamp":1318451113000},"page":"1161-1165","source":"Crossref","is-referenced-by-count":14,"title":["DPSO-based Rectilinear Steiner Minimal Tree construction considering bend reduction"],"prefix":"10.1109","author":[{"given":"Genggeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Guolong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699146"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952674"},{"journal-title":"The Principles and Algorithms of VLSI Layout Design","year":"1998","author":"hong","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968100"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/43.331412"},{"key":"1","first-page":"81","article-title":"Exact algorithms for plane steiner tree problems: A computational study","author":"warme","year":"1998","journal-title":"Advances in Steiner Trees"},{"key":"10","first-page":"597","article-title":"An efficient discrete particle swarm optimization algorithm for multi-criteria minimum spanning tree","volume":"22","author":"guo","year":"2009","journal-title":"Int l J Pattern Recognition and Artificial Intelligence"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144184"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-009-0501-6"},{"journal-title":"Discrete Particle Swarm Optimzation-llustrated by the Traveling Salesman Problem","year":"2000","author":"clerc","key":"8"}],"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\/6022138\/06022221.pdf?arnumber=6022221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T04:34:11Z","timestamp":1490070851000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6022221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icnc.2011.6022221","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}