{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:21:24Z","timestamp":1740100884331,"version":"3.37.3"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,8]]},"DOI":"10.23919\/acc53348.2022.9867459","type":"proceedings-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:24:10Z","timestamp":1662409450000},"page":"1453-1458","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Programming Approach to the Minimum Cost Sparsest Input Selection for Structured Systems"],"prefix":"10.23919","author":[{"given":"Yuan","family":"Zhang","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology,School of Automation,Beijing,China"}]},{"given":"Yuanqing","family":"Xia","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology,School of Automation,Beijing,China"}]},{"given":"Yufeng","family":"Zhan","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology,School of Automation,Beijing,China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TAC.1974.1100557","article-title":"Structural controllability","volume":"19","author":"lin","year":"1974","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2437525"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171062"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.02.005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263985"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.4603"},{"journal-title":"On minimum cost sparsest input-connectivity for controllability of linear systems","year":"2018","author":"dey","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2903225"},{"journal-title":"Combinatorial Optimization Networks and Matroids","year":"2001","author":"lawler","key":"ref18"},{"key":"ref19","article-title":"Integral boundary points of convex polyhedra","volume":"38","author":"hoffman","year":"1956","journal-title":"Linear Inequalities and Related Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2453711"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2337974"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.12.025"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2303236"},{"journal-title":"Structural systems theory an overview of the last 15 years","year":"0","author":"ramos","key":"ref8"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1038\/nature10011","article-title":"Controllability of complex networks","volume":"48","author":"liu","year":"2011","journal-title":"Nature"},{"key":"ref2","first-page":"487","article-title":"A review of methods for input\/output selection","volume":"48","author":"wal","year":"2001","journal-title":"Automatica"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(03)00104-3"},{"key":"ref1","article-title":"Total unimodularity and strongly polynomial solvability of constrained minimum input selections for structural controllability : an LP-based method, under review","author":"zhang","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0044459"},{"journal-title":"Theory of Linear and Integer Programming","year":"1998","author":"schrijver","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.23"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"journal-title":"Code for a linear programming approach to the minimum cost sparsest input selection for structured systems","year":"0","author":"zhang","key":"ref26"},{"key":"ref25","first-page":"332","article-title":"Speeding-up linear programming using fast matrix multiplication, in: 30th annual symposium on foundations of computer science","author":"vaidya","year":"1989","journal-title":"IEEE Computer Society"}],"event":{"name":"2022 American Control Conference (ACC)","start":{"date-parts":[[2022,6,8]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2022,6,10]]}},"container-title":["2022 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9866948\/9867142\/09867459.pdf?arnumber=9867459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:24:20Z","timestamp":1665433460000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9867459\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,8]]},"references-count":26,"URL":"https:\/\/doi.org\/10.23919\/acc53348.2022.9867459","relation":{},"subject":[],"published":{"date-parts":[[2022,6,8]]}}}