{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:13Z","timestamp":1725559213804},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262961"},{"type":"electronic","value":"9783540321194"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499251_10","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T02:45:11Z","timestamp":1279075511000},"page":"97-104","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-Cost Optimization in Multicommodity Logistic Chain Network"],"prefix":"10.1007","author":[{"given":"Hongxia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuicheng","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochen","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/0305-0548(94)00085-M","volume":"22","author":"A.K. Aggarwal","year":"1995","unstructured":"Aggarwal, A.K., Oblak, M., Vemuganti, R.R.: A heuristic solution procedure for multicommodity integer flows. Computer Operation Research\u00a022(10), 1075\u20131087 (1995)","journal-title":"Computer Operation Research"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","volume":"97","author":"R.K. Ahuja","year":"1997","unstructured":"Ahuja, R.K., Kodialam, M., Mishra, A.K., Orlin, J.B.: Computational investigations of maximum flow algorithms. European J. of Operational Research\u00a097, 509\u2013554 (1997)","journal-title":"European J. of Operational Research"},{"key":"10_CR3","volume-title":"Network Flows and Matching: First DIMACS Implementation Challenge","author":"R.J. Anderson","year":"1993","unstructured":"Anderson, R.J., Sctubal, J.C.: Parallel and sequential implementations of maximum flow algorithms. In: Johnson, D.S., McGeoch, C.C. (eds.) Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence (1993)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.endm.2004.03.010","volume":"17","author":"R. Aringhierie","year":"2004","unstructured":"Aringhierie, R., Cordone, R.: The Multicommodity Multilevel Bottleneck Assignment Problem. Electronic Notes in Discrete Mathematics\u00a017, 35\u201340 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0453-4514(00)88749-9","volume":"43","author":"T. Asano","year":"2000","unstructured":"Asano, T., Asano, Y.: Recent developments in maximum flow algorithms. Journal of the Operations Research Society of Japan\u00a043(1), 2\u201331 (2000)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A. Assad","year":"1978","unstructured":"Assad, A.: Multicommodity network flows, a survey. Networks\u00a08, 37\u201391 (1978)","journal-title":"Networks"},{"key":"10_CR7","volume-title":"Network Flows and Matching: First DIMACS Implementation Challenge","author":"T. Badics","year":"1993","unstructured":"Badics, T., Boros, E., Cepek, O.: Implementing a new maximum flow algorithm. In: Johnson, D.S., McGeoch, C.C. (eds.) Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence (1993)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0305-0548(98)00019-7","volume":"53","author":"J.E. Beasley","year":"1998","unstructured":"Beasley, J.E., Cao, B.: A Dynamic Programming based algorithm for the Crew Scheduling Problem. Computers & Operations Research\u00a053, 567\u2013582 (1998)","journal-title":"Computers & Operations Research"},{"unstructured":"Bertsekas, D.P.: An auction algorithm for the max-flow problem. In: IEEE Conference on the Foundations of Computer Science, pp. 118\u2013123 (1994)","key":"10_CR9"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(02)00505-2","volume":"150","author":"H.I. Calvete","year":"2003","unstructured":"Calvete, H.I.: Network simplex algorithm for the general equal flow problem. European J. of Operational Research\u00a0150, 585\u2013600 (2003)","journal-title":"European J. of Operational Research"},{"unstructured":"Cappanera, P., Gallo, G.: On the Airline Crew Rostering Problem. European J. of Operational Research\u00a0150 (2003)","key":"10_CR11"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0377-2217(84)90071-7","volume":"16","author":"P. Carraresi","year":"1984","unstructured":"Carraresi, P., Gallo, G.: A Multi-level Bottleneck Assignment Approach to the bus drivers\u2019 roistering problem. European J. of Operational Res.\u00a016, 163\u2013173 (1984)","journal-title":"European J. of Operational Res."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0305-0548(00)00058-7","volume":"29","author":"N.D. Curet","year":"2002","unstructured":"Curet, N.D., DeVinney, J., Gaston, M.E.: An efficient network flow code for finding all minimum cost s-t cutsets. Computers & Operations Research\u00a029, 205\u2013219 (2002)","journal-title":"Computers & Operations Research"},{"key":"10_CR14","first-page":"383","volume":"33","author":"U. Derigs","year":"1989","unstructured":"Derigs, U., Meier, W.: Implementing Goldberg\u2019s max-flow algorithm: A computational investigation. Zeitschrift fur Operations Research\u00a033, 383\u2013403 (1989)","journal-title":"Zeitschrift fur Operations Research"},{"key":"10_CR15","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Doklady\u00a011, 1277\u20131280 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"10_CR16","doi-asserted-by":"publisher","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. Journal of the ACM\u00a019, 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/nav.3800250104","volume":"4","author":"J.R. Evans","year":"1978","unstructured":"Evans, J.R.: The simplex method for integral multicommodity networks. Naval Res. Logistics\u00a04, 31\u201337 (1978)","journal-title":"Naval Res. Logistics"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0305-0548(80)90024-6","volume":"7","author":"J.R. Evans","year":"1980","unstructured":"Evans, J.R.: Reducing computational effort in detecting integral multicommodity networks. Computation Operation Research\u00a07, 261\u2013265 (1980)","journal-title":"Computation Operation Research"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canad. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canad. J. Math."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(99)00020-6","volume":"25","author":"V. Gabrela","year":"1999","unstructured":"Gabrela, V., Knippelb, A., Minouxb, M.: Exact solution of multicommodity network optimization problems with general step cost functions. Operations Research Letters\u00a025, 15\u201323 (1999)","journal-title":"Operations Research Letters"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N.: Scaling algorithms for network flow problems. Journal of Computer and System Sciences\u00a031, 148\u2013168 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR22","doi-asserted-by":"publisher","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. Journal of the ACM\u00a035, 921\u2013940 (1988)","journal-title":"Journal of the ACM"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02288321","volume":"13","author":"D. Goldfarb","year":"1988","unstructured":"Goldfarb, D., Grigoriadis, M.D.: A computational comparison of the Dinic and network simplex methods for maximum flow. Annals of Operations Research\u00a013, 83\u2013123 (1988)","journal-title":"Annals of Operations Research"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0167-6377(91)90039-R","volume":"10","author":"D. Goldfarb","year":"1991","unstructured":"Goldfarb, D., Hao, J.: On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Operations Res. Letters\u00a010, 383\u2013387 (1991)","journal-title":"Operations Res. Letters"},{"issue":"3","key":"10_CR25","first-page":"231","volume":"30","author":"A. Haghani","year":"1996","unstructured":"Haghani, A., Oh, S.: Formulation and solution of a multicommodity, multi-modal network flow model for disaster relief operations. Transportation Research\u00a030(3), 231\u2013250 (1996)","journal-title":"Transportation Research"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/net.3230140204","volume":"14","author":"R. Hassin","year":"1984","unstructured":"Hassin, R.: On multicommodity flows in planar graphs. Networks\u00a014, 225\u2013235 (1984)","journal-title":"Networks"},{"key":"10_CR27","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Math. Doklady\u00a015, 434\u2013437 (1974)","journal-title":"Soviet Math. Doklady"},{"key":"10_CR28","volume-title":"Algorithms for Network Programming","author":"J. Kennington","year":"1980","unstructured":"Kennington, J., Helgason, R.: Algorithms for Network Programming. John Wiley & Sons, New York (1980)"},{"unstructured":"Li, H.-X.: A Study on Optimization of Transportation and sale of A Variety of Coal in Chongqing Area, Master\u2019s Degree Thesis, Xi\u2019an Univ. of Science & Tech (1993)","key":"10_CR29"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02579295","volume":"3","author":"M.V. Lomonosov","year":"1983","unstructured":"Lomonosov, M.V.: On the planar integer two-flow problem. Combinatorica\u00a03, 207\u2013218 (1983)","journal-title":"Combinatorica"},{"key":"10_CR31","volume-title":"Network Flows and Matching: First DIMACS Implementation Challenge","author":"Q.C. Nguyen","year":"1993","unstructured":"Nguyen, Q.C., Venkateshwaran, V.: Implementations of the Goldberg Tarjan maximum flow algorithm. In: Johnson, D.S., McGeoch, C.C. (eds.) Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra and Geometric Algebra with Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499251_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:41:51Z","timestamp":1619491311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499251_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262961","9783540321194"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11499251_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}