{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:04:03Z","timestamp":1725872643015},"publisher-location":"Cham","reference-count":15,"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_19","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T21:56:02Z","timestamp":1480456562000},"page":"233-243","source":"Crossref","is-referenced-by-count":0,"title":["On the Facets of Combinatorial Polytopes"],"prefix":"10.1007","author":[{"given":"Ruslan","family":"Simanchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inna","family":"Urazova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.W.: Solving large-scale zero-one linear programming problems. J. Oper. Res. 31(5), 803\u2013834 (1983)","journal-title":"J. Oper. Res."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., Holland, O.: Solution of large-scale symmetric traveling salesman problems. J. Math. Program. 51, 141\u2013202 (1991)","journal-title":"J. Math. Program."},{"key":"19_CR3","first-page":"537","volume":"11","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Clique tree inequalities and the symmetric traveling salesman problem. J. Math. Program. 11, 537\u2013569 (1989)","journal-title":"J. Math. Program."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"ES Gottlieb","year":"1990","unstructured":"Gottlieb, E.S., Rao, M.R.: The generalized assignment problem: valid inequalities and facets. J. Math. Program. 46, 31\u201352 (1990)","journal-title":"J. Math. Program."},{"key":"19_CR5","unstructured":"Kononov, A.V., Simanchev, R., Urazova, I.V.: On separation problem of same support inequalities class for M-graphs polytope. In: 17-th National Conference Mathematical Methods for Pattern Recognition, pp. 78\u201379, Moscow (2015)"},{"key":"19_CR6","volume-title":"Combinatorial Optimization. Theory and Algorithms","author":"B Korte","year":"2006","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. Theory and Algorithms. Springer, Heidelberg (2006)"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"MW Padberg","year":"1980","unstructured":"Padberg, M.W.: $$(1, k)$$ Configurations and facets for packing problems. J. Math. Program. 18, 94\u201399 (1980)","journal-title":"J. Math. Program."},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"MW Padberg","year":"1990","unstructured":"Padberg, M.W., Rinaldi, G.: Facet identification for the symmetric traveling salesman polytope. J. Math. Program. 47, 219\u2013257 (1990)","journal-title":"J. Math. Program."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"MW Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. J. SIAM Rev. 33, 60\u2013100 (1991)","journal-title":"J. SIAM Rev."},{"key":"19_CR10","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"A Schrijver","year":"2004","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Heidelberg (2004)"},{"issue":"3","key":"19_CR11","first-page":"84","volume":"3","author":"RY Simanchev","year":"1996","unstructured":"Simanchev, R.Y.: On rank inequalities generating facets of a polytope of connected k-factors. J. Diskretn. Anal. Issled. Oper. 3(3), 84\u2013110 (1996). (Russian)","journal-title":"J. Diskretn. Anal. Issled. Oper."},{"issue":"2","key":"19_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1134\/S1990478915020143","volume":"9","author":"RY Simanchev","year":"2015","unstructured":"Simanchev, R.Y., Urazova, I.V.: On the polytope faces of the graph approximation problem. J. Appl. Ind. Math. 9(2), 283\u2013291 (2015)","journal-title":"J. Appl. Ind. Math."},{"issue":"10","key":"19_CR13","doi-asserted-by":"crossref","first-page":"2102","DOI":"10.1134\/S0005117910100097","volume":"71","author":"RY Simanchev","year":"2010","unstructured":"Simanchev, R.Y., Urazova, I.V.: An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences. J. Autom. Remote Control. 71(10), 2102\u20132108 (2010)","journal-title":"J. Autom. Remote Control."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"29","author":"LA Wolsey","year":"1990","unstructured":"Wolsey, L.A.: Valid inequalities for 0\u20131 Knapsacks and MIPS with generalised upper bound constraints. J. Discrete Appl. Math. 29, 251\u2013261 (1990)","journal-title":"J. Discrete Appl. Math."},{"key":"19_CR15","volume-title":"Polytopes, Graphs and Optimisation","author":"V Yemelichev","year":"1984","unstructured":"Yemelichev, V., Kovalev, M., Kravtsov, M.: Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge (1984)"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T04:47:45Z","timestamp":1498366065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}