{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:18:12Z","timestamp":1761895092753},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_14","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"177-190","source":"Crossref","is-referenced-by-count":14,"title":["Branched Polyhedral Systems"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Loos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods\u00a06(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"14_CR2","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended Formulations in Combinatorial Optimization. Technical Report (2009)"},{"key":"14_CR3","volume-title":"50 Years of Integer Programming 1958-2008","author":"M. Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958-2008. Springer, Heidelberg (2010)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1287\/moor.1080.0354","volume":"34","author":"M. Conforti","year":"2009","unstructured":"Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.: Network formulations of mixed-integer programs. Math. Oper. Res.\u00a034, 194\u2013209 (2009)","journal-title":"Math. Oper. Res."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. Journal of Research of the National Bureau of Standards\u00a069B, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1090.0392","volume":"34","author":"Y. Faenza","year":"2009","unstructured":"Faenza, Y., Kaibel, V.: Extended formulations for packing and partitioning orbitopes. Math. Oper. Res.\u00a034(3), 686\u2013697 (2009)","journal-title":"Math. Oper. Res."},{"key":"14_CR7","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: The hidden matching structure of the composition of strips: a polyhedral perspective. In: 14th Aussois Workshop on Combinatorial Optimization, Aussois (January 2010)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-13036-6_11","volume-title":"IPCO 2010","author":"V. Kaibel","year":"2010","unstructured":"Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. In: Eisenbrand, F., Shepherd, B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 135\u2013148. Springer, Heidelberg (2010)"},{"issue":"1, Ser. A","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V. Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program.\u00a0114(1, Ser. A), 1\u201336 (2008)","journal-title":"Math. Program."},{"key":"14_CR10","unstructured":"Margot, F.: Composition de Polytopes Combinatoires: Une Approche par Projection. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (1994)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"R.K. Martin","year":"1990","unstructured":"Martin, R.K., Rardin, R.L., Campbell, B.A.: Polyhedral characterization of discrete dynamic programming. Oper. Res.\u00a038(1), 127\u2013138 (1990)","journal-title":"Oper. Res."},{"key":"14_CR12","unstructured":"Schaffers, M.: On Links Between Graphs with Bounded Decomposability, Existence of Efficient Algorithms, and Existence of Polyhedral Characterizations. Ph.D. thesis, Universit\u00e9 Catholique de Louvain (1994)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:51:56Z","timestamp":1619783516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}