{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:59Z","timestamp":1740133319603,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Major Science and Technology Special Project of China","award":["2017ZX01028101-003"],"award-info":[{"award-number":["2017ZX01028101-003"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB0201304"],"award-info":[{"award-number":["2016YFB0201304"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61474026","61574044","61574046","61674042","61774045","61628402"],"award-info":[{"award-number":["61474026","61574044","61574046","61674042","61774045","61628402"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010871","name":"Recruitment Program of Global Experts","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010871","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1718570"],"award-info":[{"award-number":["1718570"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tvlsi.2018.2828603","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T19:18:17Z","timestamp":1526671097000},"page":"1613-1626","source":"Crossref","is-referenced-by-count":0,"title":["Cut Redistribution and Insertion for Advanced 1-D Layout Design via Network Flow Optimization"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8328-404X","authenticated-orcid":false,"given":"Ye","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6545-2196","authenticated-orcid":false,"given":"Wenlong","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Wai-Shing","family":"Luk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2164-8175","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Dian","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5705-2501","authenticated-orcid":false,"given":"David Z.","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8097-4053","authenticated-orcid":false,"given":"Xuan","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.1060.0175","article-title":"Scatter search and local NLP solvers: A multistart framework for global optimization","volume":"19","author":"zsolt","year":"2007","journal-title":"INFORMS J Comp"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002518"},{"key":"ref33","first-page":"2951","article-title":"Practical Bayesian optimization of machine learning algorithms","author":"snoek","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","first-page":"2546","article-title":"Algorithms for hyper-parameter optimization","author":"bergstra","year":"2011","journal-title":"Proc Int Conf Neural Inf Process Syst (NIPS)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.11.009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.4135\/9781412984928"},{"journal-title":"Gaussian Processes for Machine Learning","year":"2005","author":"rasmussen","key":"ref35"},{"journal-title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions with Application to Active User Modeling and Hierarchical Reinforcement Learning","year":"2010","author":"brochu","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1117\/12.814435"},{"journal-title":"Gurobi Optimizer","year":"2017","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1117\/12.2030684"},{"key":"ref12","first-page":"1","article-title":"Throughput optimization for SADP and E-beam based manufacturing of 1D layout","author":"ding","year":"2014","journal-title":"Proc IEEE\/ACM Design Autom Conf (DAC)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2012.6165047"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858349"},{"key":"ref15","first-page":"1","article-title":"Incorporating cut redistribution with mask assignment to enable 1D gridded design","author":"kuang","year":"2017","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Design (ICCAD)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1117\/12.2025688"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2742060.2742114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1117\/1.JMM.14.3.031211"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2872350"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1117\/12.868483"},{"key":"ref4","first-page":"1","article-title":"Layout decomposition for quadruple patterning lithography and beyond","author":"yu","year":"2014","journal-title":"Proc IEEE\/ACM Design Autom Conf (DAC)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2888394"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691115"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024741"},{"journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties","year":"1999","author":"ausiello","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1572471.1572474"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059037"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2252054"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228579"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654108"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2404878"},{"journal-title":"Network Flows","year":"2001","author":"ahuja","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"article-title":"Cardinality optimization problems","year":"2013","author":"abdi","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76368"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_161"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.0805"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2512903"},{"article-title":"The minimum cost flow problem and the network simplex method","year":"1991","author":"damian","key":"ref25"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/92\/8444866\/8360950-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/92\/8444866\/08360950.pdf?arnumber=8360950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:31Z","timestamp":1649443711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8360950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2018.2828603","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"type":"print","value":"1063-8210"},{"type":"electronic","value":"1557-9999"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}