{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T19:11:54Z","timestamp":1717528314697},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,9]],"date-time":"2010-05-09T00:00:00Z","timestamp":1273363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0373-7","type":"journal-article","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T00:55:17Z","timestamp":1273280117000},"page":"441-454","source":"Crossref","is-referenced-by-count":7,"title":["On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency"],"prefix":"10.1007","volume":"124","author":[{"given":"Martin","family":"Skutella","sequence":"first","affiliation":[]},{"given":"Alexia","family":"Weber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,9]]},"reference":[{"key":"373_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/moor.24.1.35","volume":"24","author":"D. Alevras","year":"1999","unstructured":"Alevras D.: Small min-cut polyhedra. Math. Oper. Res. 24, 35\u201349 (1999)","journal-title":"Math. Oper. Res."},{"key":"373_CR2","unstructured":"Carr, R.D., Konjevod, G., Little, G., Natarajan, V., Parekh, O.: Compacting cuts: a new linear formulation for minimum cut. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 43\u201352 (2007)"},{"key":"373_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.disc.2002.12.001","volume":"277","author":"M. Conforti","year":"2004","unstructured":"Conforti M., Rinaldi G., Wolsey L.: On the cut polyhedron. Discrete Math. 277, 279\u2013285 (2004)","journal-title":"Discrete Math."},{"key":"373_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"IT-2","author":"P. Elias","year":"1956","unstructured":"Elias P., Feinstein A., Shannon C.E.: Note on maximum flow through a network. IRE Trans. Inf. Theory IT-2, 117\u2013119 (1956)","journal-title":"IRE Trans. Inf. Theory"},{"key":"373_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford L.R., Fulkerson D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"373_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L.R. Ford","year":"1958","unstructured":"Ford L.R., Fulkerson D.R.: A suggested computation for maximal multicommodity network flows. Manag. Sci. 5, 97\u2013101 (1958)","journal-title":"Manag. Sci."},{"key":"373_CR7","first-page":"93","volume-title":"Graph Theory and Its Applications","author":"D.R. Fulkerson","year":"1970","unstructured":"Fulkerson D.R.: Blocking polyhedra. In: Harris, B. (eds) Graph Theory and Its Applications, pp. 93\u2013112. Academic Press, New York (1970)"},{"key":"373_CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"Fulkerson D.R.: Blocking and anti-blocking pairs of polyhedra. Math. Program. 1, 168\u2013194 (1971)","journal-title":"Math. Program."},{"key":"373_CR9","unstructured":"Garg, N., Vazirani, V.V.: A polyhedron with all s-t cuts as vertices, and adjacency of cuts. In: Rinaldi, G., Wolsey, L.A. (eds.) Integer Programming and Combinatorial Optimization, pp. 281\u2013289 (1993)"},{"key":"373_CR10","first-page":"17","volume":"70","author":"N. Garg","year":"1995","unstructured":"Garg N., Vazirani V.V.: A polyhedron with all s-t cuts as vertices, and adjacency of cuts. Math. Program. 70, 17\u201325 (1995)","journal-title":"Math. Program."},{"key":"373_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"373_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0373-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0373-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0373-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:08Z","timestamp":1559109008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0373-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,9]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0373-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,9]]}}}