{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T20:39:58Z","timestamp":1696883998000},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T00:00:00Z","timestamp":1163808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2007,10,2]]},"DOI":"10.1007\/s11590-006-0030-5","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:50:09Z","timestamp":1163767809000},"page":"341-354","source":"Crossref","is-referenced-by-count":6,"title":["Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements"],"prefix":"10.1007","volume":"1","author":[{"given":"Mohamed","family":"Haouari","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Mrad","sequence":"additional","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,18]]},"reference":[{"key":"30_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B. (1993) Network Flows: Theory, Algorithms and Applications. Prentice Hall, Upper River"},{"key":"30_CR2","first-page":"311","volume-title":"Annotated Bibilographies in Combinatorial Optimization","author":"A. Balakrishnan","year":"1997","unstructured":"Balakrishnan A., Magnanti T.L., Mirchandani P. (1997) Network design. In: Dell\u2019Amico M., Maffioli F., Martello S. (eds) Annotated Bibilographies in Combinatorial Optimization. Wiley, New York, pp. 311\u2013334"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders J.F. (1962) Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252","journal-title":"Numer. Math."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"A.M. Costa","year":"2005","unstructured":"Costa A.M. (2005) A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32, 1492\u20131450","journal-title":"Comput. Oper. Res."},{"key":"30_CR5","volume-title":"Equilibrium Problems and Variational Models","author":"B. Eksioglu","year":"2001","unstructured":"Eksioglu B., Eksioglu S.D., Pardalos P.M. (2001) Solving large scale fixed charge network flow problem. In: Mangeri A., Giannesi F., Pardalos P.M., (eds) Equilibrium Problems and Variational Models. Kluwer, Dordrecht"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion A.M., Graves G.W. (1974) Multicommodity distribution system design by Benders decomposition. Manage. Sci. 20, 822\u2013844","journal-title":"Manage. Sci."},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0110020","volume":"10","author":"R.E. Gomory","year":"1962","unstructured":"Gomory R.E., Hu T.C. (1962) An application of generalized linear programming to network flows. SIAM J. Appl. Math. 10, 260\u2013283","journal-title":"SIAM J. Appl. Math."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W.M. Hirsh","year":"1968","unstructured":"Hirsh W.M., Dantzig G.B. (1968) The fixed charge problem. Naval Res. Logistics Q. 15, 413\u2013424","journal-title":"Naval Res. Logistics Q."},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1002\/net.3230210606","volume":"21","author":"D.B. Khang","year":"1991","unstructured":"Khang D.B., Fujiwara O. (1991) Approximate solutions of capacitated fixed-charge minimum cost network flow problems. Networks 21, 689\u2013704","journal-title":"Networks"},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim D., Pardalos P.M. (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195\u2013203","journal-title":"Oper. Res. Lett."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1021145103592","volume":"115","author":"H.J. Kim","year":"2002","unstructured":"Kim H.J., Hooker J.N. (2002) Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Ann. Oper. Res. 115, 95\u2013124","journal-title":"Ann. Oper. Res."},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1287\/mnsc.43.10.1431","volume":"43","author":"B.W. Lamar","year":"1997","unstructured":"Lamar B.W., Wallace C.A. (1997) Revised-modified penalties for fixed charge transportation problems. Manage. Sci. 43, 1431\u20131436","journal-title":"Manage. Sci."},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Magnanti T.L., Wong R.T. (1984) Network design and transportation planning: models and algorithms. Transportation Sci. 18, 1\u201355","journal-title":"Transportation Sci."},{"key":"30_CR14","first-page":"269","volume":"11","author":"M. Minoux","year":"1981","unstructured":"Minoux M. (1981) Optimum synthesis of a network with non-simultaneous multicommodity flow requirements. Ann. Discrete Math. 11, 269\u2013277","journal-title":"Ann. Discrete Math."},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux M. (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313\u2013360","journal-title":"Networks"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1014554606793","volume":"106","author":"M. Minoux","year":"2001","unstructured":"Minoux M. (2001) Discrete cost multicommodity network optimization problems and exact solution methods. Ann. Oper. Res. 106, 19\u201346","journal-title":"Ann. Oper. Res."},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"Murty K.G. (1968) Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268\u2013279","journal-title":"Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0030-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-006-0030-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0030-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:01Z","timestamp":1559574901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-006-0030-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,18]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,2]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0030-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,18]]}}}