{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:04:02Z","timestamp":1725872642579},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449135"},{"type":"electronic","value":"9783319449142"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44914-2_17","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T21:56:02Z","timestamp":1480456562000},"page":"206-219","source":"Crossref","is-referenced-by-count":1,"title":["On Integer Recognition over Some Boolean Quadric Polytope Extension"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Nikolaev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580600","volume":"60","author":"F Barahona","year":"1993","unstructured":"Barahona, F.: On cuts and matchings in planar graphs. Math. Program. 60, 53\u201368 (1993)","journal-title":"Math. Program."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1134\/S0005117914090082","volume":"75","author":"VA Bondarenko","year":"2014","unstructured":"Bondarenko, V.A., Nikolaev, A.V., Symanovich, M.E., Shemyakin, R.O.: On a recognition problem on cut polytope relaxations. Autom. Remote Control 75, 1626\u20131636 (2014)","journal-title":"Autom. Remote Control"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1134\/S0005117907060021","volume":"68","author":"VA Bondarenko","year":"2007","unstructured":"Bondarenko, V.A., Uryvaev, B.V.: On one problem of integer optimization. Autom. Remote Control 68, 948\u2013953 (2007)","journal-title":"Autom. Remote Control"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C Simone De","year":"1990","unstructured":"De Simone, C.: The cut polytope and the Boolean quadric polytope. Discrete Math. 79, 71\u201375 (1990)","journal-title":"Discrete Math."},{"key":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics (Algorithms and Combinatorics)","author":"MM Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics (Algorithms and Combinatorics). Springer, Heidelberg (1997)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., De Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62, 1\u201317 (2015)","journal-title":"J. ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00454-014-9655-9","volume":"53","author":"V Kaibel","year":"2015","unstructured":"Kaibel, V., Weltge, S.: A short proof that the extension complexity of the correlation polytope grows exponentially. Discrete Comput. Geom. 53, 397\u2013401 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"5583","DOI":"10.12988\/ams.2015.57491","volume":"9","author":"A Nikolaev","year":"2015","unstructured":"Nikolaev, A.: On vertex denominators of the Boolean quadric polytope relaxation. Appl. Math. Sci. 9, 5583\u20135591 (2015)","journal-title":"Appl. Math. Sci."},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139\u2013172 (1989)","journal-title":"Math. Program."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, (STOC 1978), pp. 216\u2013226. ACM, New York (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Discrete Optimization and Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44914-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T04:47:44Z","timestamp":1498366064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}