{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:13:21Z","timestamp":1771658001448,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613107","type":"print"},{"value":"9783540684534","type":"electronic"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:20Z","timestamp":1330291700000},"page":"58-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Integer multicommodity flow problems"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Barnhart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher A.","family":"Hane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pamela H.","family":"Vance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"5_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 (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/trsc.3.1.53","volume":"3","author":"L.H. Appelgren","year":"1969","unstructured":"L.H. Appelgren (1969). A column generation algorithm for a ship scheduling problem. Transportation Science 3, 53\u201368.","journal-title":"Transportation Science"},{"key":"5_CR3","series-title":"Report","volume-title":"An Alternative Formulation and Solution Strategy for Multi-Commodity Network Flow Problems","author":"C. Barnhart","year":"1991","unstructured":"C. Barnhart, C.A. Hane, E.L. Johnson, and G. Sigismondi (1991). An Alternative Formulation and Solution Strategy for Multi-Commodity Network Flow Problems. Report COC-9102, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"5_CR4","series-title":"Report","volume-title":"Branch-and-Price: Column Generation for Solving Huge Integer Programs","author":"C. Barnhart","year":"1995","unstructured":"C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance (1995). Branch-and-Price: Column Generation for Solving Huge Integer Programs. Report COC-9502, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"5_CR5","unstructured":"CPLEX Optimization, Inc. (1990). Using the CPLEXTM Linear Optimizer."},{"key":"5_CR6","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 (1967). Generalized Upper Bounding Techniques. Journal Computer System Sci. 1, 213\u2013226.","journal-title":"Journal Computer System Sci."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe (1960) Decomposition Principle for Linear Programs. Operations Research 8, 108\u2013111.","journal-title":"Operations Research"},{"key":"5_CR8","unstructured":"J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis (1994). Time constrained routing and scheduling. M.E. Ball, T.L. Magnanti, C. Monma, And G.L. Nemhauser (eds.). Handbooks in Operations Research and Management Science, Volume on Networks, to appear."},{"key":"5_CR9","unstructured":"IBM Corporation (1990). Optimization Subroutine Library, Guide and Reference."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"E.L. Johnson (1989). Modeling and Strong Linear Programs for Mixed Integer Programming. S.W. Wallace (ed.) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series 51, 1\u201341.","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"5_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey (1988). Integer and Combinatorial Optimization. Wiley, Chichester."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"G.L. Nemhauser, M.W.P. Savelsbergh, and G.C. Sigismondi (1994). MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15, 47\u201358.","journal-title":"Operations Research Letters"},{"key":"5_CR13","unstructured":"M. Parker and J. Ryan (1994). A column generation algorithm for bandwidth packing. Telecommunications Systems, to appear."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BF01386073","volume":"6","author":"J.B. Rosen","year":"1964","unstructured":"J.B. Rosen (1964) Primal Partition Programming for Block Diagonal Matrices. Numerische Mathematik 6, 250\u2013260.","journal-title":"Numerische Mathematik"},{"key":"5_CR15","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"D.M. Ryan","year":"1981","unstructured":"D.M. Ryan and B.A. Foster (1981). An integer programming approach to scheduling. A. Wren (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, 269\u2013280."},{"key":"5_CR16","volume-title":"Exceptions in Crew Planning","author":"P.H. Vance","year":"1994","unstructured":"P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, D. Mahidara, A. Krishna, and R. Rebello (1994). Exceptions in Crew Planning. ORSA\/TIMS Detroit, Michigan."},{"key":"5_CR17","volume-title":"CORE Discussion Papaer","author":"F. Vanderbeck","year":"1994","unstructured":"F. Vanderbeck and L.A. Wolsey (1994). An Exact Algorithm for IP Column Generation. CORE Discussion Papaer, Universite Catholique de Louvain, Belgium."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:24:24Z","timestamp":1713633864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}