{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:30:33Z","timestamp":1771338633829,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":["Computers & Electrical Engineering"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0045-7906(00)00015-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:37:10Z","timestamp":1027611430000},"page":"201-216","source":"Crossref","is-referenced-by-count":3,"title":["A practical and efficient approach to the constrained via minimization problem"],"prefix":"10.1016","volume":"27","author":[{"given":"Mao-Lin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Hui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hock-Chuan","family":"Chua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0045-7906(00)00015-X_BIB1","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large apertures","author":"Hashimoto","year":"1971"},{"issue":"5","key":"10.1016\/S0045-7906(00)00015-X_BIB2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TCS.1983.1085357","article-title":"A graph-theoretic via minimization algorithm for two-layer PCBs","volume":"30","author":"Chen","year":"1983","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0045-7906(00)00015-X_BIB3","first-page":"554","article-title":"Fast algorithm for optimal layer assignment","author":"Kuo","year":"1988"},{"key":"10.1016\/S0045-7906(00)00015-X_BIB4","first-page":"123","article-title":"Optimal layer assignment for interconnect","volume":"1","author":"Pinter","year":"1984","journal-title":"J. VLSI Comp. Syst."},{"key":"10.1016\/S0045-7906(00)00015-X_BIB5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1109\/31.52754","article-title":"On via minimization","volume":"37","author":"Barahona","year":"1990","journal-title":"IEEE Trans. Circuits Systems"},{"issue":"2","key":"10.1016\/S0045-7906(00)00015-X_BIB6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/31.20197","article-title":"A unified approach to the via minimization problem","volume":"36","author":"Xiong","year":"1989","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0045-7906(00)00015-X_BIB7","series-title":"Algorithm aspects of VLSI layout","article-title":"Constrained via minimization and signed hyergraph partitioning","author":"Shi","year":"1993"},{"issue":"1","key":"10.1016\/S0045-7906(00)00015-X_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TCAD.1987.1270247","article-title":"Efficient algorithms for layer assignment problem","volume":"6","author":"Chang","year":"1987","journal-title":"IEEE Trans. on CAD"},{"issue":"3","key":"10.1016\/S0045-7906(00)00015-X_BIB9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0045-7906(95)00004-E","article-title":", An efficient mutli-layer diagonal router for multi-terminal printed circuit boards","volume":"21","author":"Mody","year":"1995","journal-title":"Computers Elect. Engng."},{"issue":"8","key":"10.1016\/S0045-7906(00)00015-X_BIB10","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/43.511580","article-title":"A neural network model for multilayer topological via minimization in a switchbox","volume":"15","author":"Funabiki","year":"1996","journal-title":"IEEE trans. on CAD"},{"issue":"10","key":"10.1016\/S0045-7906(00)00015-X_BIB11","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Commun. ACM"},{"key":"10.1016\/S0045-7906(00)00015-X_BIB12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"et. al., Optimization by simulated annealing","volume":"220","author":"Kirckpatrick","year":"1983","journal-title":"Science"}],"container-title":["Computers & Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S004579060000015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S004579060000015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T08:23:47Z","timestamp":1555921427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S004579060000015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S004579060000015X"],"URL":"https:\/\/doi.org\/10.1016\/s0045-7906(00)00015-x","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}