{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:25:40Z","timestamp":1771705540295,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0925-7721(03)00048-8","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T17:31:23Z","timestamp":1063733483000},"page":"151-178","source":"Crossref","is-referenced-by-count":56,"title":["Inner and outer approximations of polytopes using boxes"],"prefix":"10.1016","volume":"27","author":[{"given":"Alberto","family":"Bemporad","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Filippi","sequence":"additional","affiliation":[]},{"given":"Fabio D.","family":"Torrisi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(03)00048-8_BIB001","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02187886","article-title":"Computing the volume is difficult","volume":"2","author":"B\u00e1r\u00e1ny","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(03)00048-8_BIB002","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-7721(01)00004-9","article-title":"Convexity recognition of the union of polyhedra","volume":"18","author":"Bemporad","year":"2001","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB003","series-title":"Polytopes, Combinatorics and Computation","article-title":"Exact volume computation for convex polytopes: A practical study","volume":"vol. 29","author":"B\u00fceler","year":"2000"},{"issue":"3","key":"10.1016\/S0925-7721(03)00048-8_BIB004","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/322139.322141","article-title":"Two algorithms for determining volumes of convex polyhedra","volume":"26","author":"Cohen","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB005","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01583784","article-title":"Optimal scaling of balls and polyhedra","volume":"23","author":"Eaves","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB006","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01582241","article-title":"On the complexity of four polyhedral set containment problems","volume":"33","author":"Freund","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB007","author":"Fukuda"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB008","author":"Fukuda"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB009","series-title":"Handbook of Discrete and Computational Geometry","year":"1997"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB010","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581243","article-title":"Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces","volume":"59","author":"Gritzmann","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB011","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","article-title":"On the complexity of some basic problems in computational convexity: I. Containment problems","volume":"136","author":"Gritzmann","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0925-7721(03)00048-8_BIB013","series-title":"Interior-Point Polynomial Algorithms in Convex Programming, Studies in Applied Mathematics","author":"Nesterov","year":"1994"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB014","series-title":"Handbook of Computational Geometry","year":"2000"},{"key":"10.1016\/S0925-7721(03)00048-8_BIB015","series-title":"Proc. 40th IEEE Conf. on Decision and Control","first-page":"2899","article-title":"Discrete-time hybrid modeling and verification","author":"Torrisi","year":"2001"},{"issue":"3","key":"10.1016\/S0925-7721(03)00048-8_BIB016","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0218195997000168","article-title":"Approximating convex polyhedra with axis-parallel boxes","volume":"7","author":"Zhu","year":"1997","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(03)00048-8_BIB017","series-title":"Lectures on Polytopes","author":"Ziegler","year":"1995"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000488?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000488?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T04:30:24Z","timestamp":1550982624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772103000488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0925772103000488"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(03)00048-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}