{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:46Z","timestamp":1775729146050,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00454-013-9533-x","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:52:35Z","timestamp":1378201955000},"page":"679-699","source":"Crossref","is-referenced-by-count":33,"title":["Polytopes of Minimum Positive Semidefinite Rank"],"prefix":"10.1007","volume":"50","author":[{"given":"Jo\u00e3o","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Richard Z.","family":"Robinson","sequence":"additional","affiliation":[]},{"given":"Rekha R.","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"issue":"1","key":"9533_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"9533_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties and Algorithms","author":"D Cox","year":"1992","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties and Algorithms. Springer, New York (1992)"},{"key":"9533_CR3","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Proceedings of STOC, New York (2012)","DOI":"10.1145\/2213977.2213988"},{"issue":"3","key":"9533_CR4","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1007\/s00454-012-9421-9","volume":"48","author":"S Fiorini","year":"2012","unstructured":"Fiorini, S., Rothvoss, T., Tiwary, H.R.: Extended formulations for polygons. Discrete Comput. Geom. 48(3), 658\u2013668 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9533_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.disc.2012.09.015","volume":"313","author":"S Fiorini","year":"2013","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1), 67\u201383 (2013)","journal-title":"Discret. Math."},{"issue":"11","key":"9533_CR6","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11), 2685\u20132712 (2012)","journal-title":"Linear Algebra Appl."},{"key":"9533_CR7","unstructured":"Goemans, M.: Smallest compact formulation of the permutahedron. Math. Program. B (to appear)"},{"issue":"4","key":"9533_CR8","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20(4), 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"key":"9533_CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38, 248\u2013264 (2013)","journal-title":"Math. Oper. Res."},{"key":"9533_CR10","unstructured":"Grayson, D.R., Stillman, M.E.: Macaulay 2, a software system for research in algebraic geometry. http:\/\/www.math.uiuc.edu\/Macaulay2\/"},{"key":"9533_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"key":"9533_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, 2nd edn. Springer, New York (2003)","edition":"2"},{"key":"9533_CR13","first-page":"287","volume-title":"IPCO 2011, LNCS","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Pashkovich, K.: Constructing extended formulations from reflection relations. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011, LNCS, pp. 287\u2013300. Springer, Berlin (2011)"},{"issue":"1","key":"9533_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9533_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9533_CR16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9533-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9533-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9533-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:50:37Z","timestamp":1559073037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9533-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9533"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9533-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}