{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:06:16Z","timestamp":1648829176213},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"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-0378-2","type":"journal-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T04:18:51Z","timestamp":1274156331000},"page":"317-348","source":"Crossref","is-referenced-by-count":1,"title":["Separation, dimension, and facet\u00a0algorithms for node flow polyhedra"],"prefix":"10.1007","volume":"124","author":[{"given":"Maren","family":"Martens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Thomas","family":"McCormick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Queyranne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"key":"378_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01585705","volume":"53","author":"R.K. Ahuja","year":"1992","unstructured":"Ahuja R.K., Goldberg A.V., Orlin J.B., Tarjan R.E.: Finding minimum-cost flows by double scaling. Math. Prog. 53, 243\u2013266 (1992)","journal-title":"Math. Prog."},{"key":"378_CR2","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York (1993)"},{"key":"378_CR3","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1137\/0218065","volume":"18","author":"R.K. Ahuja","year":"1989","unstructured":"Ahuja R.K., Orlin J.B., Tarjan R.E.: Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939\u2013954 (1989)","journal-title":"SIAM J. Comput."},{"key":"378_CR4","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2007","unstructured":"Applegate D.L., Bixby R.E., Chv\u00e1tal V., Cook W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"key":"378_CR5","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/msom.2.2.166.12349","volume":"2","author":"A. Balakrishnan","year":"2000","unstructured":"Balakrishnan A., Geunes J.: Requirements Planning with Substitutions: Exploring Bill-of-Materials Flexibility in Production Planning. MSOM 2, 166\u2013185 (2000)","journal-title":"MSOM"},{"key":"378_CR6","first-page":"420","volume":"31","author":"M.O. Ball","year":"2003","unstructured":"Ball M.O., Chen C.-Y., Zhao Z.-Y.: Material compatibility constraints for make-to-order production planning. OR Lett. 31, 420\u2013428 (2003)","journal-title":"OR Lett."},{"key":"378_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01586039","volume":"54","author":"R.G. Bland","year":"1992","unstructured":"Bland R.G., Jensen D.L.: On the computational behavior of a polynomial-time network flow algorithm. Math. Prog. 54, 1\u201339 (1992)","journal-title":"Math. Prog."},{"key":"378_CR8","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1111\/j.1937-5956.2002.tb00470.x","volume":"11","author":"C.-Y. Chen","year":"2002","unstructured":"Chen C.-Y., Zhao Z., Ball M.O.: A model for batch advanced available-to-promise. Prod. Oper. Manage. 11, 424\u2013440 (2002)","journal-title":"Prod. Oper. Manage."},{"key":"378_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/S0097539791221529","volume":"24","author":"J. Cheriyan","year":"1995","unstructured":"Cheriyan J., Hagerup T.: A randomized maximum-flow algorithm. SIAM J. Comput. 24, 203\u2013226 (1995)","journal-title":"SIAM J. Comput."},{"key":"378_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)"},{"key":"378_CR11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds J., Karp R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"378_CR12","first-page":"28","volume":"4","author":"K. Fordyce","year":"1998","unstructured":"Fordyce K.: Matching assets with demand engines for PROFIT and supply chain management. MicroNews 4, 28\u201332 (1998)","journal-title":"MicroNews"},{"key":"378_CR13","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"378_CR14","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg A.V.: Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24, 494\u2013504 (1995)","journal-title":"SIAM J. Comput."},{"key":"378_CR15","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg A.V., Rao S.: Beyond the flow decomposition barrier. J. ACM 45, 753\u2013797 (1998)","journal-title":"J. ACM"},{"key":"378_CR16","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg A.V., Tarjan R.E.: A new approach to the maximum flow problem. J. ACM 35, 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"378_CR17","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A.V. Goldberg","year":"1990","unstructured":"Goldberg A.V., Tarjan R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"378_CR18","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":"378_CR19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M., Padberg M.W.: On the symmetric traveling salesman problem II: Lifting theorems and facets. Math. Prog. 16, 281\u2013302 (1979)","journal-title":"Math. Prog."},{"key":"378_CR20","doi-asserted-by":"crossref","unstructured":"Hoffman A.J.(1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Bellman, R., Hall, M., Jr. (eds.) Proceedings of Symposia in Applied Mathematics, vol. X, Combinatorial Analysis. American Mathematical Society, Providence RI, pp 113\u2013127","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"378_CR21","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A.J. Hoffman","year":"1974","unstructured":"Hoffman A.J.: A generalization of max flow-\u00a0min cut. Math. Prog. 6, 352\u2013359 (1974)","journal-title":"Math. Prog."},{"key":"378_CR22","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V. King","year":"1994","unstructured":"King V., Rao S., Tarjan R.: A faster deterministic maximum flow algorithm. J. Algorithms 17, 447\u2013474 (1994)","journal-title":"J. Algorithms"},{"key":"378_CR23","unstructured":"Lawler, E.L.: Generalizations of the Polymatroidal Network Flow Model. Preprint BW 158\/82 of Stichting Mathematisch Centrum, Amsterdam (1982)"},{"key":"378_CR24","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.7.3.334","volume":"7","author":"E.L. Lawler","year":"1982","unstructured":"Lawler E.L., Martel C.U.: Computing maximal polymatroidal network flows. Math. Oper. Res. 7, 334\u2013347 (1982)","journal-title":"Math. Oper. Res."},{"key":"378_CR25","doi-asserted-by":"crossref","unstructured":"Martens, M., McCormick, S.T.: A polynomial algorithm for weighted abstract flow. In: Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization, pp. 97\u2013111 (2008)","DOI":"10.1007\/978-3-540-68891-4_7"},{"key":"378_CR26","unstructured":"McCormick, S.T.: A Polynomial Algorithm for Abstract Maximum Flow. UBC Faculty of Commerce Working Paper 95-MSC-001. In: An extended abstract appears in Proceedings of the Seventh SODA, pp. 490\u2013497 (1995)"},{"key":"378_CR27","first-page":"179","volume":"78","author":"S.T. McCormick","year":"1997","unstructured":"McCormick S.T.: How to compute least infeasible flows. Math. Prog. B 78, 179\u2013194 (1997)","journal-title":"Math. Prog. B"},{"key":"378_CR28","unstructured":"McCormick, S.T., Queyranne, M.N.: Le C\u00f4ne des Flots aux Noeuds dans un R\u00e9seau Acyclique. In: Proceedings of Journ\u00e9es sur les Poly\u00e8dres en Optimisation Combinatoire at Clermont-Ferrand (in French) (2003)"},{"key":"378_CR29","volume-title":"Integer and Combinatorial Optimization","author":"G.A. Nemhauser","year":"1999","unstructured":"Nemhauser G.A., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"378_CR30","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"378_CR31","doi-asserted-by":"crossref","unstructured":"Phillips, S., Westbrook, J.: Online load balancing and network flow. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 402\u2013411 (1993)","DOI":"10.1145\/167088.167201"},{"key":"378_CR32","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.-C. Picard","year":"1980","unstructured":"Picard J.-C., Queyranne M.N.: On the structure of all minimum cuts in a network and applications. Math. Prog. Study 13, 8\u201316 (1980)","journal-title":"Math. Prog. Study"},{"key":"378_CR33","unstructured":"Queyranne, M.N.: On the node flow cone of an acyclic directed graph. In: Seventh Aussois Conference of Combinatorial Optimization (2003)"},{"key":"378_CR34","unstructured":"R\u00f6ck, H.: Scaling techniques for minimum cost network flows In: Pape, U. (ed.) Discrete Structures and Algorithms, pp. 181\u2013191. Hanser (1980)"},{"key":"378_CR35","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-0378-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0378-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0378-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0378-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0378-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,19]]}}}