{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:29:31Z","timestamp":1760887771928},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf02110307","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T04:41:23Z","timestamp":1126586483000},"page":"239-258","source":"Crossref","is-referenced-by-count":43,"title":["A column generation and partitioning approach for multi-commodity flow problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Cynthia","family":"Barnhart","sequence":"first","affiliation":[]},{"given":"Christopher A.","family":"Hane","sequence":"additional","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Sigismondi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02110307_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993)."},{"key":"BF02110307_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/07408178408974677","volume":"16","author":"A.I. Ali","year":"1984","unstructured":"A.I. Ali, D. Barnett, K. Farhangian, J.L. Kennington, B. Patty, B. Shetty, B. McCarl and P. Wong, Multicommodity network problems: Applications and computations, IIE Trans. 16(1984) 127\u2013134.","journal-title":"IIE Trans."},{"key":"BF02110307_CR3","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1287\/opre.28.4.995","volume":"28","author":"A. Ali","year":"1980","unstructured":"A. Ali, R. Helgason, J. Kennington and H. Lall, Computational comparison among three multicommodity network flow algorithms, Oper. Res. 28(1980)995\u20131000.","journal-title":"Oper. Res."},{"key":"BF02110307_CR4","volume-title":"Working Paper OR-058-76","author":"A.A. Assad","year":"1976","unstructured":"A.A. Assad, Multicommodity network flows \u2014 computational experience, Working Paper OR-058-76, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA (1976)."},{"key":"BF02110307_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A.A. Assad","year":"1978","unstructured":"A.A. Assad, Multicommodity network flows \u2014 a survey, Networks 8(1978)37\u201391.","journal-title":"Networks"},{"key":"BF02110307_CR6","first-page":"157","volume":"1","author":"A.A. Assad","year":"1980","unstructured":"A.A. Assad, Solving linear multicommodity flow problems,Proc. IEEE Int. Conf. on Circuits and Computers, Vol. 1 (1980) pp. 157\u2013161.","journal-title":"Proc. IEEE Int. Conf. on Circuits and Computers"},{"key":"BF02110307_CR7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/trsc.27.2.102","volume":"27","author":"C. Barnhart","year":"1993","unstructured":"C. Barnhart and Y. Sheffi, A network-based primal-dual heuristic for the solution of multicommodity network flow problems, Transportation Sci. 27(1993)102\u2013117.","journal-title":"Transportation Sci."},{"key":"BF02110307_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4","volume":"40","author":"C. Barnhart","year":"1993","unstructured":"C. Barnhart, Dual-ascent methods for large-scale multi-commodity flow problems, Naval Res. Logist. Quart. 40(1993)305\u2013324.","journal-title":"Naval Res. Logist. Quart."},{"key":"BF02110307_CR9","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1977","unstructured":"M.S. Bazaraa and J.J. Jarvis,Linear Programming and Network Flows (Wiley, New York, 1977)."},{"key":"BF02110307_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Oper. Res. 8(1960) 101\u2013111.","journal-title":"Oper. Res."},{"key":"BF02110307_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.M. Van Slyke, Generalized upper bounding techniques, J. Comput. Syst. Sci. 1(1967)213\u2013226.","journal-title":"J. Comput. Syst. Sci."},{"key":"BF02110307_CR12","volume-title":"Document No. SC 23-0519-2","author":"J. Druckerman","year":"1991","unstructured":"J. Druckerman, D. Silverman and K. Viaropulos, IBM optimization subroutine library guide and reference, Release 2, Document No. SC 23-0519-2, IBM, Kingston, NY (1991)."},{"key":"BF02110307_CR13","volume-title":"Working Paper 90-04","author":"J.M. Farvolden","year":"1990","unstructured":"J.M. Farvolden and W.B. Powell, A primal partitioning solution for multicommodity network flow problems, Working Paper 90-04, Department of Industrial Engineering, University of Toronto, Canada (1990)."},{"key":"BF02110307_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.18.3.375","volume":"18","author":"A.M. Geoffrion","year":"1970","unstructured":"A.M. Geoffrion, Primal resource-directive approaches for optimizing non-linear decomposable systems, Oper. Res. 18(1970)375\u2013403.","journal-title":"Oper. Res."},{"key":"BF02110307_CR15","first-page":"748","volume-title":"A new algorithm for the solution of the minimum cost multicommodity flow problem","author":"A. Gersht","year":"1987","unstructured":"A. Gersht and A. Shulman, A new algorithm for the solution of the minimum cost multicommodity flow problem,Proc. 26th IEEE Conf. on Decision and Control (IEEE, New York, NY, 1987) pp. 748\u2013758."},{"key":"BF02110307_CR16","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/1014070","volume":"14","author":"R.C. Grinold","year":"1972","unstructured":"R.C. Grinold, Steepest ascent for a large-scale linear program, SIAM Rev. 14(1972)447\u2013464.","journal-title":"SIAM Rev."},{"key":"BF02110307_CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230010404","volume":"1","author":"J.K. Hartman","year":"1972","unstructured":"J.K. Hartman and L.S. Lasdon, A generalized upper bounding algorithm for multicommodity network flow problems, Networks 1(1972)333\u2013354.","journal-title":"Networks"},{"key":"BF02110307_CR18","volume-title":"Technical Report SOR 91-23","author":"K.L. Jones","year":"1992","unstructured":"K.L. Jones, I.J. Lustig, J.M. Farvolden and W.B. Powell, Multicommodity network flows: The impact of formulation on decomposition, Technical Report SOR 91-23, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1992)."},{"key":"BF02110307_CR19","first-page":"339","volume-title":"Methods of Operations Research 40","author":"J. Karkazis","year":"1981","unstructured":"J. Karkazis and T.B. Boffey, A subgradient based optimal solution method for the multicommodity problem, in:Methods of Operations Research 40, eds. R.E. Burkard and T. Ellinger (Koenigstein, Anton Hain Meisenheim, 1981) pp. 339\u2013344."},{"key":"BF02110307_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/nav.3800240210","volume":"24","author":"J.L. Kennington","year":"1977","unstructured":"J.L. Kennington, Solving multicommodity transportation problems using a primal partitioning simplex technique, Naval Res. Logist. Quart. 24(1977)309\u2013325.","journal-title":"Naval Res. Logist. Quart."},{"key":"BF02110307_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J.L. Kennington","year":"1978","unstructured":"J.L. Kennington, A survey of linear cost network flows, Oper. Res. 26(1978)209\u2013236.","journal-title":"Oper. Res."},{"key":"BF02110307_CR22","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980)."},{"key":"BF02110307_CR23","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1287\/mnsc.23.9.994","volume":"23","author":"J.L. Kennington","year":"1977","unstructured":"J.L. Kennington and M. Shalaby, An effective subgradient procedure for minimal cost multicommodity flow problems, Manag. Sci. 23(1977)994\u20131004.","journal-title":"Manag. Sci."},{"key":"BF02110307_CR24","volume-title":"Optimization Theory for Large Systems","author":"S. Lasdon","year":"1970","unstructured":"S. Lasdon,Optimization Theory for Large Systems (MacMillan, New York, 1970)."},{"key":"BF02110307_CR25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Appl. 152(1991)191\u2013222.","journal-title":"Linear Algebra and Its Appl."},{"key":"BF02110307_CR26","unstructured":"S.F. Maier, A compact inverse scheme applied to a multicommodity network with resource constraints, in:Optimization Methods for Resource Allocation, eds. R. Cottle and J. Krarup (English Universities Press, 1974) pp. 179\u2013203."},{"key":"BF02110307_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230070102","volume":"7","author":"C.J. McCallum","year":"1977","unstructured":"C.J. McCallum, A generalized upper bounding approach to a communications network planning problem, Networks 7(1977)1\u201323.","journal-title":"Networks"},{"key":"BF02110307_CR28","volume-title":"Mathematical Programming: Theory and Algorithms","author":"M. Minoux","year":"1986","unstructured":"M. Minoux,Mathematical Programming: Theory and Algorithms (Wiley, New York, 1986)."},{"key":"BF02110307_CR29","unstructured":"K. Ritter, A decomposition method for linear programming problems with coupling constraints and variables, Report No. 739, Mathematics Research Center, University of Wisconsin (1967)."},{"key":"BF02110307_CR30","volume-title":"RM-1799","author":"J.T. Robacker","year":"1956","unstructured":"J.T. Robacker, Notes on linear programming: Part XXXVII concerning multicommodity networks, RM-1799, The Rand Corporation, Santa Monica, CA (1956)."},{"key":"BF02110307_CR31","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01386073","volume":"6","author":"J.B. Rosen","year":"1964","unstructured":"J.B. Rosen, Primal partition programming for block diagonal matrices, Numer. Mathematik 6(1964)250\u2013260.","journal-title":"Numer. Mathematik"},{"key":"BF02110307_CR32","volume-title":"ORC 67-38, Operations Research Center","author":"R. Saigal","year":"1967","unstructured":"R. Saigal, Multicommodity flows in directed networks, ORC 67-38, Operations Research Center, University of California, Berkeley, CA (1967)."},{"key":"BF02110307_CR33","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/0115080","volume":"15","author":"M. Sakarovitch","year":"1967","unstructured":"M. Sakarovitch and R. Saigal, An extension of generalized upper bounding techniques for structured linear programs, SIAM J. Appl. Math. 15(1967)906\u2013914.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02110307_CR34","volume-title":"Ph.D. Dissertation","author":"R. Schneur","year":"1991","unstructured":"R. Schneur, Scaling algorithms for multi-commodity flow problems and network flow problems with side constraints, Ph.D. Dissertation, Department of Civil Engineering, MIT, Cambridge, MA (1991)."},{"key":"BF02110307_CR35","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1057\/jors.1990.121","volume":"41","author":"B. Shetty","year":"1990","unstructured":"B. Shetty and R. Muthukrishnan, A parallel projection for the multicommodity network model, J. Oper. Res. Soc. 41(1990)837\u2013842.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02110307_CR36","volume-title":"Working Paper No. 184","author":"C. Swoveland","year":"1971","unstructured":"C. Swoveland, Decomposition algorithms for the multicommodity distribution problem, Working Paper No. 184, Western Management Science Institute, University of California, Los Angeles, CA (1971)."},{"key":"BF02110307_CR37","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.14.1.45","volume":"14","author":"J.A. Tomlin","year":"1966","unstructured":"J.A. Tomlin, Minimum-cost multicommodity network flows, Oper. Res. 14(1966)45\u201351.","journal-title":"Oper. Res."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02110307.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02110307\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02110307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T15:19:19Z","timestamp":1557847159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02110307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF02110307"],"URL":"https:\/\/doi.org\/10.1007\/bf02110307","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}