{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:36Z","timestamp":1725586836894},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_26","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"324-335","source":"Crossref","is-referenced-by-count":2,"title":["A Primal-Dual Algorithm for Weighted Abstract Cut Packing"],"prefix":"10.1007","author":[{"given":"S. Thomas","family":"McCormick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"37","volume":"10","author":"D.L. Applegate","year":"1991","unstructured":"Applegate, D.L., Cook, W.J., McCormick, S.T.: Integral Infeasibility and Testing Total Dual Integrality. OR Letters\u00a010, 37\u201341 (1991)","journal-title":"OR Letters"},{"key":"26_CR2","unstructured":"Birkhoff, G.: Lattice Theory. Amer. Math. Soc.\u00a091 (1991)"},{"key":"26_CR3","unstructured":"Faigle, U., Peis, B.: Two-phase greedy algorithms for some classes of combinatorial linear programs. In: Proceedings SODA 2008, pp. 161\u2013166 (2008)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal Flow through a Network. Canadian J. of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian J. of Mathematics"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s101070050040","volume":"84","author":"A. Frank","year":"1999","unstructured":"Frank, A.: Increasing the rooted connectivity of a digraph by one. Math. Programming\u00a084, 565\u2013576 (1999)","journal-title":"Math. Programming"},{"key":"26_CR6","unstructured":"Fujishige, S., Peis, B.: Lattice Polyhedra and Submodular Flows. In: Proc. of Cologne-Twente-Workshop, CTW 2010 (2010) (to appear)"},{"key":"26_CR7","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. North-Holland, Amsterdam (2005)","edition":"2"},{"key":"26_CR8","doi-asserted-by":"publisher","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. Prog.\u00a01, 168\u2013194 (1971)","journal-title":"Math. Prog."},{"key":"26_CR9","first-page":"189","volume":"15","author":"H. Groflin","year":"1982","unstructured":"Groflin, H., Hoffman, A.J.: Lattice Polyhedra II: Generalizations, Constructions, and Examples. Annals of Discrete Mathematics\u00a015, 189\u2013203 (1982)","journal-title":"Annals of Discrete Mathematics"},{"key":"26_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A.J. Hoffman","year":"1974","unstructured":"Hoffman, A.J.: A Generalization of Max Flow-Min Cut. Math. Prog.\u00a06, 352\u2013359 (1974)","journal-title":"Math. Prog."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BFb0121202","volume":"8","author":"A.J. Hoffman","year":"1978","unstructured":"Hoffman, A.J.: On Lattice Polyhedra III: Blockers and Anti-Blockers of Lattice Clutters. Math. Prog. Study\u00a08, 197\u2013207 (1978)","journal-title":"Math. Prog. Study"},{"key":"26_CR13","first-page":"593","volume-title":"Proceedings of Fifth Hungarian Combinatorial Coll","author":"A. Hoffman","year":"1978","unstructured":"Hoffman, A., Schwartz, D.E.: On lattice polyhedra. In: Hajnal, A., Sos, V.T. (eds.) Proceedings of Fifth Hungarian Combinatorial Coll, pp. 593\u2013598. North-Holland, Amsterdam (1978)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-68891-4_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Martens","year":"2008","unstructured":"Martens, M., McCormick, S.T.: A Polynomial Algorithm for Weighted Abstract Flow. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 97\u2013111. Springer, Heidelberg (2008)"},{"key":"26_CR15","unstructured":"McCormick, S.T.: A Polynomial Algorithm for Abstract Maximum Flow. Extended abstract. In: Proceedings of the 7th ACM-SIAM SODA, pp. 490\u2013497 (1995)"},{"key":"26_CR16","first-page":"321","volume-title":"Handbook on Discrete Optimization","author":"S.T. McCormick","year":"2006","unstructured":"McCormick, S.T.: Submodular Function Minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, ch. 7, pp. 321\u2013391. Elsevier, Amsterdam (2006)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10107-008-0242-9","volume":"122","author":"S.T. McCormick","year":"2010","unstructured":"McCormick, S.T., Fujishige, S.: Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization. Mathematical Programming\u00a0122, 87\u2013120 (2010)","journal-title":"Mathematical Programming"},{"key":"26_CR18","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"},{"key":"26_CR19","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York (1986)"},{"key":"26_CR20","first-page":"305","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of Regular Matroids. JCT B\u00a028, 305\u2013359 (1980)","journal-title":"JCT B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:04:48Z","timestamp":1553810688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}