{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:47:05Z","timestamp":1725979625096},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899190"},{"type":"electronic","value":"9783319899206"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_28","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:59:40Z","timestamp":1527253180000},"page":"197-203","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extended Formulations for Column Constrained Orbitopes"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Hojny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E. (1998). Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics, 89(1), 3\u201344.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"28_CR2","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T. A., & Hu, Y. (2011). The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software, 38(1), 1\u201325.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"3","key":"28_CR3","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. (2009). Extended formulations for packing and partitioning orbitopes. Mathematics of Operations Research, 34(3), 686\u2013697.","journal-title":"Mathematics of Operations Research"},{"key":"28_CR4","unstructured":"Gamrath, G., Fischer, T., Gally, T., Gleixner, A. M., Hendel, G., Koch, T., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M. E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Vigerske, S., Weninger, D., Winkler, M., Witt, J. T., Witzig, J. (2016). The SCIP Optimization Suite 3.2. Technical Report 15-60, ZIB, Takustr. 7, 14195 Berlin."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-0348-8438-9_2","volume-title":"Polytopes \u2014 Combinatorics and Computation","author":"Ewgenij Gawrilow","year":"2000","unstructured":"Gawrilow, E., & Joswig, M. (2000). Polymake: A framework for analyzing convex polytopes. In Polytopes \u2013 combinatorics and computation (pp. 43\u201374)."},{"key":"28_CR6","unstructured":"Hojny, C., & Pfetsch, M. E. (2017). Polytopes associated with symmetry handling. \nwww.optimization-online.org\/DB_HTML\/2017\/01\/5835.html\n\n."},{"key":"28_CR7","unstructured":"Kaibel, V., & Loos, A. (2011). Finding descriptions of polytopes via extended formulations and liftings. In: A. R. Mahjoub (Ed.), Progress in combinatorial optimization. New Jersey: Wiley."},{"issue":"1","key":"28_CR8","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. E. (2008). Packing and partitioning orbitopes. Mathematical Programming, 114(1), 1\u201336.","journal-title":"Mathematical Programming"},{"key":"28_CR9","first-page":"77","volume":"18","author":"SE Karisch","year":"1998","unstructured":"Karisch, S. E., & Rendl, F. (1998). Semidefinite programming and graph equipartition. Topics in Semidefinite and Interior-Point Methods, 18, 77\u201395.","journal-title":"Topics in Semidefinite and Interior-Point Methods"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., & Kumar, V. (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1), 359\u2013392.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser, A., & Rendl, F. (2003). Graph partitioning using linear and semidefinite programming. Mathematical Programming, 95(1), 91\u2013101.","journal-title":"Mathematical Programming"},{"key":"28_CR12","unstructured":"Loos, A. (2011). Describing orbitopes by linear inequalities and projection based tools. Ph.D. thesis, Universit\u00e4t Magdeburg."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T13:11:17Z","timestamp":1527253877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_28","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2018]]}}}