{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:47:28Z","timestamp":1776106048222,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T00:00:00Z","timestamp":1234483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s11590-009-0114-0","type":"journal-article","created":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T07:48:47Z","timestamp":1243842527000},"page":"347-355","source":"Crossref","is-referenced-by-count":22,"title":["Bilinear modeling solution approach for fixed charge network flow problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Steffen","family":"Rebennack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artyom","family":"Nahapetyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,13]]},"reference":[{"key":"114_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.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"issue":"4","key":"114_CR2","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0803042","volume":"3","author":"I.M. Bomze","year":"1993","unstructured":"Bomze I.M., Danninger G.: A global optimization algorithm for concave quadratic programming problems. SIAM J. Optim. 3(4), 826\u2013842 (1993)","journal-title":"SIAM J. Optim."},{"key":"114_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S. Burer","year":"2008","unstructured":"Burer S., Vandenbussche D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113, 259\u2013282 (2008)","journal-title":"Math. Program."},{"key":"114_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A. Cabot","year":"1984","unstructured":"Cabot A., Erenguc S.: Some branch-and-bound procedures for fixed-cost transportation problems. Nav. Res. Log. Q. 31, 145\u2013154 (1984)","journal-title":"Nav. Res. Log. Q."},{"issue":"6","key":"114_CR5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/02331930500342534","volume":"54","author":"A. Chinchuluun","year":"2005","unstructured":"Chinchuluun A., Pardalos P.M., Enkhbat R.: Global minimization algorithms for concave quadratic programming problems. Optimization 54(6), 627\u2013639 (2005)","journal-title":"Optimization"},{"issue":"6","key":"114_CR6","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"A.M. Costa","year":"2005","unstructured":"Costa A.M.: A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005)","journal-title":"Comput. Oper. Res."},{"key":"114_CR7","volume-title":"Graph Theory. Electronic Edition","author":"R. Diestel","year":"2000","unstructured":"Diestel R.: Graph Theory. Electronic Edition. Springer, New-York (2000)"},{"key":"114_CR8","volume-title":"Solving Large Scale Fixed Charge Network Flow Problems","author":"B. Eksioglu","year":"2001","unstructured":"Eksioglu B., Duni-Eksioglu S., Pardalos P.M.: Equilibrium problems and variational models. In: Maugeri, A., Giannesi, F., Pardalos, P.M. (eds) Solving Large Scale Fixed Charge Network Flow Problems, Kluwer, Dordrecht (2001)"},{"key":"114_CR9","first-page":"217","volume-title":"Quadratic Optimization","author":"C. Floudas","year":"1995","unstructured":"Floudas C., Visweswaran V.: Handbook of global optimization. In: Horst, R., Pardalos, P. (eds) Quadratic Optimization, pp. 217\u2013269. Kluwer, Dordrecht (1995)"},{"issue":"1","key":"114_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/net.20167","volume":"50","author":"D.B.M.M. Fontes","year":"2007","unstructured":"Fontes D.B.M.M., Goncalves J.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50(1), 67\u201376 (2007)","journal-title":"Networks"},{"issue":"1","key":"114_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"D.B. Fontes","year":"2006","unstructured":"Fontes D.B., Hadjiconstantinou E., Christofides N.: A branch-and-bound algorithm for concave network flow problems. J. Glob. Optim. 34(1), 127\u2013155 (2006)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"114_CR12","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.ejor.2005.03.024","volume":"174","author":"D.B.M.M. Fontes","year":"2006","unstructured":"Fontes D.B.M.M., Hadjiconstantinou E., Christofides N.: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174(2), 1205\u20131219 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"114_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b137269","volume-title":"Supply Chain Optimization","author":"J. Guenes","year":"2005","unstructured":"Guenes J., Pardalos P.M.: Supply Chain Optimization. Springer, Berlin (2005)"},{"key":"114_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G.M. Guisewite","year":"1990","unstructured":"Guisewite G.M., Pardalos P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25, 75\u2013100 (1990)","journal-title":"Ann. Oper. Res."},{"key":"114_CR15","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W. Hirsch","year":"1968","unstructured":"Hirsch W., Dantzig G.: The fixed charge problem. Nav. Res. Log. Q. 15, 413\u2013424 (1968)","journal-title":"Nav. Res. Log. Q."},{"key":"114_CR16","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.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"114_CR17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D. Kim","year":"2000","unstructured":"Kim D., Pardalos P.M.: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks 35(3), 216\u2013222 (2000)","journal-title":"Networks"},{"key":"114_CR18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10614-006-9028-4","volume":"2\u20133","author":"D. Kim","year":"2006","unstructured":"Kim D., Pan X., Pardalos P.M.: An enhanced dynamic slope scaling procedure with Tabu Scheme for fixed charge network flow problems. Comput. Econ. 2\u20133, 273\u2013293 (2006)","journal-title":"Comput. Econ."},{"key":"114_CR19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno H.: A cutting plane algorithm for solving bilinear programs. Math. Programm. 11, 14\u201327 (1976)","journal-title":"Math. Programm."},{"key":"114_CR20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K. Murty","year":"1968","unstructured":"Murty K.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268\u2013279 (1968)","journal-title":"Oper. Res."},{"key":"114_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A. Nahapetyan","year":"2007","unstructured":"Nahapetyan A., Pardalos P.M.: A bilinear relaxation based algorithm for concave piecewise linear network flow problem. J. Ind. Manage. Optim. 3, 71\u201385 (2007)","journal-title":"J. Ind. Manage. Optim."},{"key":"114_CR22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A. Nahapetyan","year":"2008","unstructured":"Nahapetyan A., Pardalos P.M.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39, 37\u201350 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"114_CR23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F. Ortega","year":"2003","unstructured":"Ortega F., Wolsey L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3), 143\u2013158 (2003)","journal-title":"Networks"},{"key":"114_CR24","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U. Palekar","year":"1990","unstructured":"Palekar U., Karwan M., Zionts S.: A branch-and-bound method for fixed charge transportation problem. Manag. Sci. 36, 1092\u20131105 (1990)","journal-title":"Manag. Sci."},{"issue":"6-7","key":"114_CR25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos P.M.: Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21(6-7), 87\u201397 (1991)","journal-title":"Comput. Math. Appl."},{"key":"114_CR26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos P.M., Vavasis S.A.: Quadratic programming with one negative eigenvalue is np-hard. J. Glob. Optim. 1, 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"issue":"1\u20134","key":"114_CR27","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01589415","volume":"42","author":"A.T. Phillips","year":"1988","unstructured":"Phillips A.T., Rosen J.B.: A parallel algorithm for constrained concave quadratic global minimization. Math. Program. 42(1\u20134), 421\u2013448 (1988)","journal-title":"Math. Program."},{"issue":"5","key":"114_CR28","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H.S. Ryoo","year":"1995","unstructured":"Ryoo H.S., Sahinidis N.V.: Global optimization of non-convex NLPs and MINLPs with application in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"114_CR29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"H.S. Ryoo","year":"1996","unstructured":"Ryoo H.S., Sahinidis N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"114_CR30","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N.V. Sahinidis","year":"1996","unstructured":"Sahinidis N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"114_CR31","first-page":"209","volume":"25","author":"H. Tuy","year":"2000","unstructured":"Tuy H.: Strong polynomial time solvability of minimum concave cost network flow problem. ACTA Math. Vietnam. 25(2), 209\u2013218 (2000)","journal-title":"ACTA Math. Vietnam."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0114-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0114-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0114-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:03Z","timestamp":1559574903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0114-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,13]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0114-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,13]]}}}