{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:22:15Z","timestamp":1744161735662,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":66,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_407","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2354-2362","source":"Crossref","is-referenced-by-count":10,"title":["Multicommodity Flow Problems"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Barnhart","sequence":"first","affiliation":[]},{"given":"Niranjan","family":"Krishnan","sequence":"additional","affiliation":[]},{"given":"Pamela H.","family":"Vance","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"407_CR1_407","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/inte.19.4.20","volume":"19","author":"J. Abara","year":"1989","unstructured":"Abara J (1989) Applying integer linear programming to the fleet assignment problem. Interfaces 19:20\u201328","journal-title":"Interfaces"},{"key":"407_CR2_407","volume-title":"Network flows: Theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs"},{"key":"407_CR3_407","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/07408178408974677","volume":"16","author":"A.I. Ali","year":"1984","unstructured":"Ali AI, Barnett D, Farhangian K, Kennington JL, Patty B, Shetty B, McCarl B, Wong P (1984) Multicommodity network problems:\n\tApplications and computations. IIE Trans 16:127\u2013134","journal-title":"IIE Trans."},{"key":"407_CR4_407","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1287\/opre.28.4.995","volume":"28","author":"A. Ali","year":"1980","unstructured":"Ali A, Helgason R, Kennington J, Lall H (1980) Computational comparison among three multicommodity network flow algorithms. Oper Res\n\t28:995\u20131000","journal-title":"Oper. Res."},{"key":"407_CR5_407","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1287\/inte.21.1.62","volume":"21","author":"R. Anbil","year":"1991","unstructured":"Anbil R, Gelman E, Patty B, Tanga R (1991) Recent advances in crew-pairing optimization at American Airlines. Interfaces\n\t21:62\u201364","journal-title":"Interfaces"},{"key":"407_CR6_407","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A.A. Assad","year":"1978","unstructured":"Assad AA (1978) Multicommoditynetwork flows - A\u00a0survey. Networks 8:37\u201391","journal-title":"Networks"},{"key":"407_CR7_407","unstructured":"Assad AA (1980) Solving linear\n      multicommodity flow problems. Proc IEEE Internat Conf Circuits and Computers 1, pp 157\u2013161"},{"key":"407_CR8_407","unstructured":"Barnett D, Binkley J, McCarl B (1982) The\n      effects of US port capacity constraints on national and world grain shipments. Techn Paper, Purdue Univ"},{"key":"407_CR9_407","doi-asserted-by":"publisher","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":"Barnhart C (1993) Dual-ascent methods for large-scale multi-commodity flow problems. Naval Res Logist\n\t40:305\u2013324","journal-title":"Naval Res. Logist."},{"issue":"3","key":"407_CR10_407","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.32.3.208","volume":"32","author":"C. Barnhart","year":"1998","unstructured":"Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG (1998) Flight string models for aircraft fleeting and\n\trouting. Transport Sci 32(3):208\u2013220, Focused Issue on Airline Optimization","journal-title":"Transport. Sci."},{"key":"407_CR11_407","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02110307","volume":"3","author":"C. Barnhart","year":"1995","unstructured":"Barnhart C, Hane CA, Johnson EL, Sigismondi G (1995) A\u00a0column generation and partitioning approach for multicommodity flow\n\tproblems. Telecommunication Systems 3:239\u2013258","journal-title":"Telecommunication Systems"},{"issue":"2","key":"407_CR12_407","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow\n\tproblems. Oper Res 48(2):318\u2013326","journal-title":"Oper. Res."},{"key":"407_CR13_407","unstructured":"Barnhart C, Jin H, Vance PH (1997)\n      Railroad blocking: A\u00a0network design application. Working Paper Center Transport Stud, MIT"},{"key":"407_CR14_407","first-page":"7","volume-title":"Optimization in Industry: Math. Programming and Optimization Techniques","author":"C. Barnhart","year":"1994","unstructured":"Barnhart C, Johnson EL, Anbil R, Hatay L (1994) A\u00a0column generation technique for the long-haul crew-assignment problem. In:\n\tCiriani TA, Leachman RC (eds) Optimization in Industry: Math. Programming and Optimization Techniques 2. Wiley, New York, pp 7\u201324"},{"issue":"3","key":"407_CR15_407","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWF, Vance PH (1998) Branch-and-price: Column generation for solving huge integer\n\tprograms. Oper Res 46(3):316\u2013329","journal-title":"Oper. Res."},{"key":"407_CR16_407","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1287\/opre.41.6.1013","volume":"41","author":"C. Barnhart","year":"1993","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Sigismondi G, Vance P (1993) Formulating a\u00a0mixed integer programming problem to improve\n\tsolvability. Oper Res 41:1013\u20131019","journal-title":"Oper. Res."},{"key":"407_CR17_407","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/trsc.27.2.102","volume":"27","author":"C. Barnhart","year":"1993","unstructured":"Barnhart C, Sheffi Y (1993) A\u00a0network-based primal-dual heuristic for the solution of multi-commodity network flow\n\tproblems. Transport Sci 27:102\u2013117","journal-title":"Transport. Sci."},{"key":"407_CR18_407","volume-title":"Linear programming and network flows","author":"M.S. Bazaraa","year":"1977","unstructured":"Bazaraa MS, Jarvis JJ (1977) Linear programming and network flows. Wiley, New York"},{"key":"407_CR19_407","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1018945415148","volume":"69","author":"L.W. Clarke","year":"1997","unstructured":"Clarke LW, Johnson GL, Nemhauser GL, Zhu Z (1997) The aircraft rotationproblem. Ann Oper Res: Math Industr Systems II\n\t69:33\u201346","journal-title":"Ann. Oper. Res.: Math. Industr. Systems II"},{"key":"407_CR20_407","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/trsc.18.2.165","volume":"18","author":"T. Crainic","year":"1984","unstructured":"Crainic T, Ferland JA, Rousseau JM (1984) A\u00a0tactical planning model for Rail freight transportation. Transport Sci\n\t18:165\u2013184","journal-title":"Transport. Sci."},{"key":"407_CR21_407","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"Dantzig GB, Van Slyke RM (1967) Generalized upper bounding techniques. J\u00a0Comput Syst Sci 1:213\u2013226","journal-title":"J. Comput. Syst. Sci."},{"key":"407_CR22_407","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:108\u2013111","journal-title":"Oper. Res."},{"key":"407_CR23_407","first-page":"35","volume-title":"Handbook Oper. Res. and Management Sci.","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Ball ME, Magnanti TL, Monma C,\n\tNemhauser GL (eds) Handbook Oper. Res. and Management Sci. 8 Elsevier, Amsterdam, pp 35\u2013139"},{"issue":"4","key":"407_CR24_407","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1287\/opre.41.4.669","volume":"4","author":"J.M. Farvolden","year":"1993","unstructured":"Farvolden JM, Powell WB, Lustig IJ (1993) A\u00a0primal partitioning solution for the arc-chain formulation of a\u00a0multicommodity\n\tnetwork flow problem. Oper Res 4(4):669\u2013693","journal-title":"Oper. Res."},{"key":"407_CR25_407","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1287\/mnsc.35.12.1415","volume":"35","author":"T.A. Feo","year":"1989","unstructured":"Feo TA, Bard JF (1989) Flight scheduling and maintenence base planning. Managem Sci 35:1415\u20131432","journal-title":"Managem. Sci."},{"key":"407_CR26_407","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0191-2615(81)90013-8","volume":"15","author":"L.R. Foulds","year":"1981","unstructured":"Foulds LR (1981) A\u00a0multicommodity flow network design problem. Transport Res B 15:273\u2013283","journal-title":"Transport. Res. B"},{"key":"407_CR27_407","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1287\/opre.18.3.375","volume":"18","author":"A.M. Geoffrion","year":"1970","unstructured":"Geoffrion AM (1970) Primal resource-directive approaches for optimizing non-linear decomposable systems. Oper Res\n\t18:375\u2013403","journal-title":"Oper. Res."},{"key":"407_CR28_407","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion AM, Graves GW (1974) Multicommodity distribution systems design by Bender's decomposition. Managem Sci\n\t20:822\u2013844","journal-title":"Managem. Sci."},{"key":"407_CR29_407","doi-asserted-by":"crossref","unstructured":"Gersht A, Shulman A (1987)\n      A\u00a0new algorithm for the solution of the minimum cost multicommodity flow problem. Proc 26th IEEE Conf Decision and Control, pp 748\u2013758","DOI":"10.1109\/CDC.1987.272489"},{"key":"407_CR30_407","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/1014070","volume":"14","author":"R.C. Grinold","year":"1972","unstructured":"Grinold RC (1972) Steepest ascent for large scale linear program. SIAM Rev 14:447\u2013464","journal-title":"SIAM Rev."},{"key":"407_CR31_407","first-page":"211","volume":"70","author":"C.A. Hane","year":"1995","unstructured":"Hane CA, Barnhart C, Johnson EL, Marsten RE, Nemhauser GL, Sigismondi G (1995) The fleet assignment problem: solving a\u00a0large-scale\n\tinteger program. Math Program 70:211\u2013232","journal-title":"Math. Program."},{"key":"407_CR32_407","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/net.3230010404","volume":"1","author":"J.K. Hartman","year":"1972","unstructured":"Hartman JK, Lasdon LS (1972) A\u00a0generalized upper bounding algorithm for multicommodity network flow problems. Networks\n\t1:333\u2013354","journal-title":"Networks"},{"key":"407_CR33_407","unstructured":"Helgason R, Kennington J, Wong P (1981)\n      An application of network programming for national forest planning. Techn Report, Dept Oper Res Southern Methodist Univ, Dallas"},{"key":"407_CR34_407","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01585162","volume":"62","author":"K.L. Jones","year":"1993","unstructured":"Jones KL, Lustig IJ, Farvolden JM, Powell WB (1993) Multicommodity network flows: The impact of formulation on decomposition. Math\n\tProgram 62:95\u2013117","journal-title":"Math. Program."},{"key":"407_CR35_407","first-page":"339","volume":"40","author":"J. Karkazis","year":"1981","unstructured":"Karkazis J, Boffey TB (1981) A\u00a0subgradient based optimal solution method for the multicommodity problem. In: Burkard RE, Ellinger\n\tT (eds) Methods Oper Res 40. Anton Hain Verlag, pp 339\u2013344","journal-title":"Methods Oper. Res."},{"key":"407_CR36_407","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/nav.3800240210","volume":"24","author":"J.L. Kennington","year":"1977","unstructured":"Kennington JL (1977) Solving multicommodity transportation problems using a\u00a0primal partitioning simplex technique. Naval Res\n\tLogist Quart 24:309\u2013325","journal-title":"Naval Res. Logist. Quart."},{"key":"407_CR37_407","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J.L. Kennington","year":"1978","unstructured":"Kennington JL (1978) A\u00a0survey of linear cost network flows. Oper Res 26:209\u2013236","journal-title":"Oper. Res."},{"key":"407_CR38_407","volume-title":"Algorithms for network programming","author":"J.L. Kennington","year":"1980","unstructured":"Kennington JL, Helgason RV (1980) Algorithms for network programming. Wiley, New York"},{"key":"407_CR39_407","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1287\/mnsc.23.9.994","volume":"23","author":"J.L. Kennington","year":"1977","unstructured":"Kennington JL, Shalaby M (1977) An effective subgradient procedure for minimal cost multicommodity flow problems. Managem Sci\n\t23:994\u20131004","journal-title":"Managem. Sci."},{"key":"407_CR40_407","unstructured":"Kim D (1997) Large scale\n      transportation service network design: Models, algorithms and applications. PhD Thesis, Dept Civil Engin, MIT"},{"key":"407_CR41_407","volume-title":"Optimization theory for large systems","author":"L. Lasdon","year":"1970","unstructured":"Lasdon L (1970) Optimization theory for large systems. MacMillan, New York"},{"key":"407_CR42_407","doi-asserted-by":"crossref","unstructured":"Magnanti TL, Mirchandani P, Vachani R\n      (1995) Modeling and solving the two-facility capacitated network loading problem. Oper Res 43(1)","DOI":"10.1287\/opre.43.1.142"},{"key":"407_CR43_407","first-page":"179","volume-title":"Optimization Methods for Resource Allocation","author":"S.F. Maier","year":"1974","unstructured":"Maier SF (1974) A\u00a0compact inverse scheme applied to a\u00a0multicommodity network with resource constraints. In: Cottle R, Krarup\n\tJ (eds) Optimization Methods for Resource Allocation. English Univ Press, London, pp 179\u2013203"},{"key":"407_CR44_407","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230070102","volume":"7","author":"C.J. McCallum","year":"1977","unstructured":"McCallum CJ (1977) A\u00a0generalized upper bounding approach to a\u00a0commununications network planning problem. Networks\n\t7:1\u201323","journal-title":"Networks"},{"key":"407_CR45_407","volume-title":"Mathematical programming: Theory and algorithms","author":"M. Minoux","year":"1986","unstructured":"Minoux M (1986) Mathematical programming: Theory and algorithms. Wiley, New York"},{"key":"407_CR46_407","unstructured":"Moore E (1957) The shortest path\n      through a\u00a0maze. In: Proc Internat Symposium on the Theory of Switching, Harvard Univ Press, pp 282\u2013292"},{"key":"407_CR47_407","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/59.260847","volume":"8","author":"N. Nabonna","year":"1993","unstructured":"Nabonna N (1993) Multicommodity network flow model for long term hydro-generation optimization. IEEE Trans Power Systems\n\t8:395\u2013404","journal-title":"IEEE Trans. Power Systems"},{"key":"407_CR48_407","unstructured":"Newton HN (1996) Network design under\n      budget constraints with application to the railroad blocking problem. PhD Thesis, Auburn Univ, Alabama"},{"key":"407_CR49_407","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M. Parker","year":"1994","unstructured":"Parker M, Ryan J (1994) A\u00a0column generation algorithm for bandwidth packing. Telecommunication Systems\n\t2:185\u2013195","journal-title":"Telecommunication Systems"},{"key":"407_CR50_407","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"4","author":"P. Raghavan","year":"1987","unstructured":"Raghavan P, Thompson CD (1987) Randomized rounding: A\u00a0technique for provably good algorithms and algorithmic proofs. Combinatorica\n\t4:365\u2013374","journal-title":"Combinatorica"},{"key":"407_CR51_407","unstructured":"Ritter K (1967) A\u00a0decomposition\n      method for linear programming problems with coupling constraints and variables. Techn Report, Math Res Center Univ Wisconsin 739"},{"key":"407_CR52_407","unstructured":"Robacker JT (1956) Notes on linear\n      programming: Part XXXVII concerning multicommodity networks. Techn Report, The Rand Corp RM-1799"},{"key":"407_CR53_407","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BF01386073","volume":"6","author":"J.B. Rosen","year":"1964","unstructured":"Rosen JB (1964) Primal partition programming for block diagonal matrices. Numerische Math 6:250\u2013260","journal-title":"Numerische Math."},{"key":"407_CR54_407","unstructured":"Saigal R (1967) Multicommodity flows in\n      directed networks. Techn Report Oper Res Center, Univ Calif ORC 67\u201338"},{"key":"407_CR55_407","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/0115080","volume":"15","author":"M. Sakarovitch","year":"1967","unstructured":"Sakarovitch M, Saigal R (1967) An extension of generalized upper bounding techniques for structured linear programs. SIAM J Appl Math\n\t15:906\u2013914","journal-title":"SIAM J. Appl. Math."},{"key":"407_CR56_407","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BFb0121100","volume":"26","author":"G. Saviozzi","year":"1986","unstructured":"Saviozzi G (1986) Advanced start for the multicommodity network flow problem. Math Program Stud 26:221\u2013224","journal-title":"Math. Program. Stud."},{"key":"407_CR57_407","unstructured":"Schneur R (1991) Scaling algorithms for\n      multi-commodity flow problems and network flow problems with side constraints. PhD Diss, Massachusetts Inst Techn"},{"key":"407_CR58_407","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1137\/0801035","volume":"1","author":"G.L. Schultz","year":"1991","unstructured":"Schultz GL, Meyer RR (1991) An interior point method for block angular optimization. SIAM J Optim 1:583\u2013602","journal-title":"SIAM J. Optim."},{"issue":"2","key":"407_CR59_407","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0307-904X(94)00024-Z","volume":"19","author":"R.S. Segall","year":"1995","unstructured":"Segall RS (1995) Mathematical modeling of spatial price equilibrium for multicommodity consumer flows of large markets using\n\tvariational inequalities. Appl Math Modeling 19(2):112\u2013122","journal-title":"Appl. Math. Modeling"},{"key":"407_CR60_407","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1038\/sj\/jors\/0410906","volume":"41","author":"B. Shetty","year":"1990","unstructured":"Shetty B, Muthukrishnan R (1990) A\u00a0parallel projection for the multicommodity network model. J\u00a0Oper Res Soc\n\t41:837\u2013842","journal-title":"J. Oper. Res. Soc."},{"key":"407_CR61_407","unstructured":"Swoveland C (1971) Decomposition\n      algorithms for the multicommodity distribution problem. Working Paper Western Management Sci Inst Univ Calif, Los Angeles 184"},{"key":"407_CR62_407","doi-asserted-by":"crossref","unstructured":"Vaidya PM (1989) Speeding up linear\n      programming using fast matrix multiplication. Proc 30th Annual Symp Foundations of Computer Sci, pp 332\u2013337","DOI":"10.1109\/SFCS.1989.63499"},{"key":"407_CR63_407","volume-title":"Exceptions in crew planning","author":"PH Vance","year":"1994","unstructured":"Vance PH, Barnhart C, Johnson EL,\n      Nemhauser GL, Mahidara D, Krishna A, Rebello R (1994) Exceptions in crew planning. ORSA\/TIMS Detroit, Michigan"},{"key":"407_CR64_407","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"Vanderbeck F, Wolsey LA (1996) An exact algorithm for IP column generation. Oper Res Lett 19:151\u2013159","journal-title":"Oper. Res. Lett."},{"key":"407_CR65_407","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1137\/0801038","volume":"1","author":"S.A. Zenios","year":"1991","unstructured":"Zenios SA (1991) On the fine-grain decomposition of multicommodity transportation problems. SIAM J Optim\n\t1:643\u2013669","journal-title":"SIAM J. Optim."},{"key":"407_CR66_407","unstructured":"Ziarati K, Soumis F, Desrosiers J,\n      Gelinas S, Saintonge A (1995) Locomotive assignment with heterogeneous consists at CN North America. Working Paper GERAD and \u00c9cole Polytechnique\n      de Montr\u00e9al"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:46:46Z","timestamp":1720691206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_407","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}