{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:14:40Z","timestamp":1752282880733},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf01096771","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T04:45:48Z","timestamp":1107578748000},"page":"261-287","source":"Crossref","is-referenced-by-count":30,"title":["An improved branch and bound algorithm for minimum concave cost network flow problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Bruce W.","family":"Lamar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/mnsc.30.2.222","volume":"30","author":"P. Afentakis","year":"1984","unstructured":"P. Afentakis, B. Gavish, and U. Karmarkar (1984), Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems,Management Science 30(2), 222?239.","journal-title":"Management Science"},{"key":"CR2","volume-title":"Ph.D. dissertation","author":"A. Balakrishnan","year":"1984","unstructured":"A. Balakrishnan (1984), Valid Inequalities and Algorithms for the Network Design Problem with Application to LTL Consolidation, Ph.D. dissertation, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"M. L. Balinski","year":"1961","unstructured":"M. L. Balinski (1961), Fixed-Cost Transportation Problems,Naval Research Logistics Quarterly 8(1), 41?54.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"CR4","first-page":"16","volume":"17","author":"R. S. Barr","year":"1979","unstructured":"R. S. Barr, F. Glover, and D. Klingman (1979), Enhancements of Spanning Tree Labelling Procedures for Network Optimization,INFOR 17(1) 16?34.","journal-title":"INFOR"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"R. S. Barr","year":"1981","unstructured":"R. S. Barr, F. Glover, and D. Klingman (1981), A New Optimization Method for Large Scale Fixed Charge Transportation Problems,Operations Research 29(3), 448?463.","journal-title":"Operations Research"},{"issue":"4","key":"CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0305-0548(88)90022-6","volume":"15","author":"K. Belling-Seib","year":"1988","unstructured":"K. Belling-Seib, P. Mever, and C. M\u00fcller (1988), Network Flow Problems with One Side Constraint: A Comparison of Three Solution Methods,Computers and Operations Research 15(4), 381?394.","journal-title":"Computers and Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A. V. Cabot","year":"1984","unstructured":"A. V. Cabot and S. S. Erenguc (1984), Some Branch-and-Bound Procedures for Fixed-Cost Transportation Problems,Naval Research Logistics Quarterly 31, 145?154.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"7","key":"CR8","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1287\/mnsc.32.7.856","volume":"32","author":"A. V. Cabot","year":"1986","unstructured":"A. V. Cabot and S. S. Erenguc (1986), Improved Penalties for Fixed Cost Linear Programs Using Lagrangian Relaxation,Management Science 32(7), 856?869.","journal-title":"Management Science"},{"issue":"7","key":"CR9","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","volume":"12","author":"N. Driebeek","year":"1966","unstructured":"N. Driebeek (1966), An algorithm for the Solution of Mixed Integer Programming Problems,Management Science 12(7), 576?587.","journal-title":"Management Science"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R. E. Erickson","year":"1987","unstructured":"R. E. Erickson, C. L. Monna, and A. F. Veinott, Jr. (1987), Send-and-Split Method for Minimum-Concave-Cost Network Flows,Mathematics of Operations Research 12(4), 634?664.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"CR11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/mnsc.18.3.184","volume":"18","author":"M. Florian","year":"1971","unstructured":"M. Florian and P. Robillard (1971), An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem,Management Science 18(3), 184?193.","journal-title":"Management Science"},{"key":"CR12","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson (1962),Flows in Networks, Princeton University Press, Princeton, NJ."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(80)90109-5","volume":"4","author":"G. Gallo","year":"1980","unstructured":"G. Gallo, C. Sandi, and C. Sodini (1980), An Algorithm for the Min Concave Cost Flow Problem,European Journal of Operational Research 4, 248?255.","journal-title":"European Journal of Operational Research"},{"key":"CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson (1979),Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, Inc., San Francisco, CA."},{"issue":"4","key":"CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.12.4.277","volume":"12","author":"F. Glover","year":"1978","unstructured":"F. Glover, D. Karney, D. Klingman, R. Russell (1978), Solving Singly Constrained Transshipment Problems,Transportation Science 12(4), 277?297.","journal-title":"Transportation Science"},{"issue":"6","key":"CR16","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P. Gray","year":"1971","unstructured":"P. Gray (1971), Exact Solution of the Fixed-Charge Transportation Problem,Operations Research 19(6), 1529?1538.","journal-title":"Operations Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G. Guisewite","year":"1990","unstructured":"G. Guisewite and P. M. Pardalos (1990), Minimum Concave Cost Network Flow Problems: Applications, Complexity, and Algorithms,Annals of Operations Research 25, 75?100.","journal-title":"Annals of Operations Research"},{"key":"CR18","first-page":"703","volume-title":"Operational Research '90","author":"G. Guisewite","year":"1991","unstructured":"G. Guisewite and P. M. Pardalos (1991a), Single-Source Uncapacitated Minimum Concave Cost Network Flow Problems, in H. E. Bradley (ed.),Operational Research '90, Pergamon Press, Oxford, England, pp. 703?713."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00119934","volume":"1","author":"G. Guisewite","year":"1991","unstructured":"G. Guisewite and P. M. Pardalos (1991b), Algorithms for the Single-Source Uncapacitated Minimum Concave-Cost Network Flow Problem,Journal of Global Optimization 1, 245?265.","journal-title":"Journal of Global Optimization"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00130828","volume":"1","author":"G. Guisewite","year":"1991","unstructured":"G. Guisewite and P. M. Pardalos (1991c), Global Search Algorithms for Minimum Concave Cost Network Flow Problems,Journal of Global Optimization 1, 309?330.","journal-title":"Journal of Global Optimization"},{"key":"CR21","first-page":"50","volume-title":"Recent Advances in Global Optimization","author":"G. Guisewite","year":"1992","unstructured":"G. Guisewite and P. M. Pardalos (1992), Performance of Local Search in Minimum Concave-Cost Network Flow Problems, in C. A. Floudas and P. M. Pardalos (eds.),Recent Advances in Global Optimization, Princeton University Press, Princeton, NJ, pp. 50?75."},{"issue":"4","key":"CR22","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.14.4.619","volume":"14","author":"E. L. Johnson","year":"1966","unstructured":"E. L. Johnson (1966), Networks and Basic Solutions,Operations Research 14(4), 619?623.","journal-title":"Operations Research"},{"issue":"10","key":"CR23","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J. Kennington","year":"1976","unstructured":"J. Kennington and E. Unger (1976), A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem,Management Science 22(10), 1116?1126.","journal-title":"Management Science"},{"key":"CR24","volume-title":"Ph.D. dissertation","author":"B. W. Lamar","year":"1985","unstructured":"B. W. Lamar (1985), Network Design Algorithms with Applications to Freight Transportation, Ph.D. dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1142\/9789812798190_0009","volume-title":"Network Optimization Problems: Algorithms,Complexity, and Applications","author":"B. W. Lamar","year":"1993","unstructured":"B. W. Lamar (1993), A Method for Solving Network Flow Problems with General Nonlinear Arc Costs, in D.-Z. Du and P. M. Pardalos (eds.),Network Optimization Problems: Algorithms, Complexity, and Applications, World Scientific, Singapore; Teaneck, NJ, pp. 147?168."},{"key":"CR26","first-page":"1","volume":"1120","author":"B. W. Lamar","year":"1988","unstructured":"B. W. Lamar and Y. Sheffi (1988), An Implicit Enumeration Method for LTL Network Design,Transportation Research Record 1120, 1?16.","journal-title":"Transportation Research Record"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/opre.38.4.704","volume":"38","author":"B. W. Lamar","year":"1990","unstructured":"B. W. Lamar, Y. Sheffi, and W. B. Powell (1990), A Capacity Improvement Lower Bound For Fixed Charge Network Design Problems,Operations Research 38, 704?710.","journal-title":"Operations Research"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J. D. C. Little","year":"1963","unstructured":"J. D. C. Little, K. C. Murty, D. W. Sweeney, and C. Karel (1963), An Algorithm for the Travelling Salesman Problem,Operations Research 11, 972?989.","journal-title":"Operations Research"},{"issue":"2","key":"CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0191-2615(82)90030-3","volume":"16B","author":"M. Los","year":"1982","unstructured":"M. Los and C. Lardinois (1982), Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem,Transportation Research-B 16B(2), 89?124.","journal-title":"Transportation Research-B"},{"issue":"5","key":"CR30","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1080\/00207177208932320","volume":"16","author":"M. Malek-Zavarei","year":"1972","unstructured":"M. Malek-Zavarei and I. T. Frisch (1972), On the Fixed Cost Flow Problem,International Journal of Control 16(5), 897?902.","journal-title":"International Journal of Control"},{"key":"CR31","volume-title":"Discrete Optimization","author":"R. G. Parker","year":"1988","unstructured":"R. G. Parker and R. L. Rardin (1988),Discrete Optimization, Academic Press, Inc., San Diego, CA."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1287\/opre.17.6.1005","volume":"17","author":"G. Sa","year":"1969","unstructured":"G. Sa(1969), Branch-and-Bound and Approximate Solutions to the Capacitated Plant Location Problem,Operations Research 17, 1005?1016.","journal-title":"Operations Research"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R. M. Soland","year":"1974","unstructured":"R. M. Soland (1974), Optimal Facility Location with Concave Costs,Operations Research 22, 373?382.","journal-title":"Operations Research"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/opre.19.4.1070","volume":"19","author":"J. A. Tomlin","year":"1971","unstructured":"J. A. Tomlin (1971), An Improved Branch and Bound Method for Integer Programming,Operations Research 19, 1070?1075.","journal-title":"Operations Research"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230010205","volume":"1","author":"B. Yaged Jr.","year":"1971","unstructured":"B. Yaged, Jr. (1971), Minimum Cost Routing for Static Network Models,Networks 1, 139?172.","journal-title":"Networks"},{"issue":"7","key":"CR36","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W. I. Zangwill","year":"1968","unstructured":"W. I. Zangwill (1968), Minimum Concave Cost Flows in Certain Networks,Management Science 14(7), 429?450.","journal-title":"Management Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01096771\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:42:28Z","timestamp":1556329348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01096771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF01096771"],"URL":"https:\/\/doi.org\/10.1007\/bf01096771","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}