{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:29:55Z","timestamp":1648981795424},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1973,7,1]],"date-time":"1973-07-01T00:00:00Z","timestamp":110332800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[1973,7]]},"DOI":"10.1016\/0010-4485(73)90069-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:51:43Z","timestamp":1047653503000},"page":"152-159","source":"Crossref","is-referenced-by-count":2,"title":["Automated module placement and wire routeing according to a structured biplanar scheme in printed boards"],"prefix":"10.1016","volume":"5","author":[{"given":"G.","family":"Alia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Frosini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Maestrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0010-4485(73)90069-9_BIB1","first-page":"12","article-title":"Recent developments in the automated design and analysis of digital systems","volume":"Vol 60","author":"Breuer","year":"1972"},{"key":"10.1016\/0010-4485(73)90069-9_BIB2","article-title":"Force-vector placement techniques","author":"Hanan","year":"1970","journal-title":"IBM Report RC 2843"},{"key":"10.1016\/0010-4485(73)90069-9_BIB3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/mnsc.13.1.42","article-title":"Quadratic assignment problem algorithms and the location of indivisible location","volume":"Vol 13","author":"Hillier","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0010-4485(73)90069-9_BIB4","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"Vol 44","author":"Lin","year":"1965","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0010-4485(73)90069-9_BIB5","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/320893.320896","article-title":"Formal procedures for connecting terminals with a minimum total wire length","volume":"Vol 4","author":"Loberman","year":"1957","journal-title":"J. ACM"},{"key":"10.1016\/0010-4485(73)90069-9_BIB6","series-title":"Soc. for Ind. and Appl. Math.","first-page":"1","article-title":"Steiner minimal trees","volume":"Vol. 16","author":"Gilbert","year":"1968"},{"key":"10.1016\/0010-4485(73)90069-9_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","article-title":"On Steiner's problem with rectilinear distance","volume":"Vol 14","author":"Hanan","year":"1966","journal-title":"SIAM J. on Appl. Math."},{"key":"10.1016\/0010-4485(73)90069-9_BIB8","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","article-title":"An algorithm for path connections and its applications","volume":"Vol EC 10","author":"Lee","year":"1961","journal-title":"IRE Trans. on Elect. Comput."},{"key":"10.1016\/0010-4485(73)90069-9_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/PGEC.1967.264620","article-title":"A modification of Lee's path connection algorithm","volume":"Vol EC 16","author":"Akers","year":"1967","journal-title":"IEEE Trans. on Elect. Comput."},{"key":"10.1016\/0010-4485(73)90069-9_BIB10","first-page":"1971","article-title":"Accel: automatic circuit card etching layout","volume":"Vol 55","author":"Fisk","year":"1967"},{"key":"10.1016\/0010-4485(73)90069-9_BIB11","first-page":"205","article-title":"On the decomposition of networks in minimally interconnected subnetworks","volume":"Vol EC 15","author":"Luccio","year":"1966","journal-title":"IEEE Trans. on Circuit Theory"},{"key":"10.1016\/0010-4485(73)90069-9_BIB12","volume":"Vol 1","year":"1971"},{"key":"10.1016\/0010-4485(73)90069-9_BIB13","article-title":"Tracciamento automatico di circuiti stampati secondo uno schema predeterminato","author":"Alia","year":"1972"},{"key":"10.1016\/0010-4485(73)90069-9_BIB14","first-page":"21","article-title":"Permutation procedure for minimizing the number of crossings in a network","volume":"Vol 115","author":"Nicholson","year":"1968"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448573900699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448573900699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:57:10Z","timestamp":1553630230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0010448573900699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,7]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1973,7]]}},"alternative-id":["0010448573900699"],"URL":"https:\/\/doi.org\/10.1016\/0010-4485(73)90069-9","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[1973,7]]}}}