{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:52:34Z","timestamp":1649177554797},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,10,10]],"date-time":"2010-10-10T00:00:00Z","timestamp":1286668800000},"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":[[2012,6]]},"DOI":"10.1007\/s10107-010-0410-6","type":"journal-article","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:58:01Z","timestamp":1286974681000},"page":"159-169","source":"Crossref","is-referenced-by-count":2,"title":["Fractional packing in ideal clutters"],"prefix":"10.1007","volume":"133","author":[{"given":"Yuji","family":"Matsuoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,10]]},"reference":[{"key":"410_CR1","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/S0895480102409619","volume":"17","author":"F. Barahona","year":"2004","unstructured":"Barahona F.: Fractional packing of T-joins. SIAM J. Discret. Math. 17, 661\u2013669 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"410_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial Optimization\u2014Packing and Covering","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G.: Combinatorial Optimization\u2014Packing and Covering. Pennsylvania, SIAM, Philadelphia (2001)"},{"key":"410_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"Edmonds J., Fulkerson D.R.: Bottleneck extrema. J. Combin. Theor. 8, 299\u2013306 (1970)","journal-title":"J. Combin. Theor."},{"key":"410_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02579270","volume":"1","author":"A. Frank","year":"1981","unstructured":"Frank A.: How to make a digraph strongly connected. Combinatorica 1, 145\u2013153 (1981)","journal-title":"Combinatorica"},{"key":"410_CR5","first-page":"93","volume-title":"Proceedings Advanced Seminar Madison, Wisconsin, 1969","author":"D.R. Fulkerson","year":"1970","unstructured":"Fulkerson D.R.: Blocking polyhedra. In: Harris, B. (ed.) Proceedings Advanced Seminar Madison, Wisconsin, 1969, pp. 93\u2013112. Academic Press, New York (1970)"},{"key":"410_CR6","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":"410_CR7","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1006\/jagm.1995.1022","volume":"18","author":"H.N. Gabow","year":"1995","unstructured":"Gabow H.N.: Centroids, representations, and submodular flows. J. Algorithm. 18, 586\u2013628 (1995)","journal-title":"J. Algorithm."},{"key":"410_CR8","first-page":"83","volume":"82","author":"H.N. Gabow","year":"1998","unstructured":"Gabow H.N., Manu K.S.: Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math. Programm. 82, 83\u2013109 (1998)","journal-title":"Math. Programm."},{"key":"410_CR9","doi-asserted-by":"crossref","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, Berlin (1988)"},{"key":"410_CR10","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"Hao J., Orlin J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithm. 17, 424\u2013446 (1994)","journal-title":"J. Algorithm."},{"key":"410_CR11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s00453-008-9179-x","volume":"56","author":"S. Iwata","year":"2010","unstructured":"Iwata S., Kobayashi Y.: An algorithm for minimum cost arc-connectivity orientations. Algorithmica 56, 437\u2013447 (2010)","journal-title":"Algorithmica"},{"key":"410_CR12","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","volume":"17","author":"A. Lehman","year":"1979","unstructured":"Lehman A.: On the width-length inequality. Math. Program. 17, 403\u2013417 (1979)","journal-title":"Math. Program."},{"key":"410_CR13","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"s2\u201317","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi C.L., Younger D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. s2\u201317, 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"410_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(80)90057-6","volume":"32","author":"A. Schrijver","year":"1980","unstructured":"Schrijver A.: A counterexample to a conjecture of Edmonds and Giles. Discret. Math. 32, 213\u2013214 (1980)","journal-title":"Discret. Math."},{"key":"410_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-68874-4_18","volume-title":"Mathematical Programming\u2014The State of the Art (Bonn, 1982)","author":"A. Schrijver","year":"1983","unstructured":"Schrijver A.: Min\u2013max results in combinatorial optimization. In: Bachem, A., Gt\u00f6tschel, M., Korte, B. (eds) Mathematical Programming\u2014The State of the Art (Bonn, 1982), pp. 439\u2013500. Springer, Berlin (1983)"},{"key":"410_CR16","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"410_CR17","unstructured":"Shepherd, F.B., Vetta, A.: Visualizing, finding and packing dijoins. In: Graph Theory and Combinatorial Optimization GERAD 25th Anniversary Volumes, pp. 1\u201336. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0410-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0410-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0410-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:09Z","timestamp":1559109009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0410-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,10]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0410-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,10]]}}}