{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:13Z","timestamp":1751367973686},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1007\/bf01096764","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T10:57:07Z","timestamp":1107860227000},"page":"135-151","source":"Crossref","is-referenced-by-count":16,"title":["The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs"],"prefix":"10.1007","volume":"6","author":[{"given":"Hoang","family":"Tuy","sequence":"first","affiliation":[]},{"given":"Saied","family":"Ghannadan","sequence":"additional","affiliation":[]},{"given":"Athanasios","family":"Migdalas","sequence":"additional","affiliation":[]},{"given":"Peter","family":"V\ufffdrbrand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman, R.E. (1958), On a routing problem,Quart. Appl. Math. 16, 87?90.","journal-title":"Quart. Appl. Math."},{"key":"CR2","unstructured":"Du, D.-Z. and P.M. Pardalos (eds.) (1993),Network Optimization Problems, World Scientific."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R.E. Ericksson","year":"1987","unstructured":"Ericksson, R.E., C.L. Monma, and A.F. Veinott (1987), Send- and-split method for minimum concave-cost network flows,Mathematics for Operations Research 12, 634?664.","journal-title":"Mathematics for Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/mnsc.18.3.184","volume":"18","author":"M. Florian","year":"1971","unstructured":"Florian, M. and P. Robillard (1971), An implicit enumeration algorithm for the concave cost network flow problem,Management Science 18, 184?193.","journal-title":"Management Science"},{"key":"CR5","unstructured":"Fredman, M.L. and R.E. Tarjan (1984), Fibonaccy heaps and their uses in improved network optimization algorithms,Proc. 25th IEEE Sympos. Foundations Computer Sci, 338?346."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(80)90109-5","volume":"4","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., C. Sandi, and C, Sodini (1980), An algorithm for the min concave cost flow problem,European Journal of Operations Research 4, 248?259.","journal-title":"European Journal of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230090202","volume":"9","author":"G. Gallo","year":"1979","unstructured":"Gallo, G. and C. Sodini (1979), Adjacent extreme flows and applications to min concave-cost flow problems,Networks 9, 95?121.","journal-title":"Networks"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G. Guisewite","year":"1990","unstructured":"Guisewite, G. 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":"CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00119934","volume":"1","author":"G. Guisewite","year":"1991","unstructured":"Guisewite, G. and P.M. Pardalos (1991), 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":"CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230230208","volume":"23","author":"G. Guisewite","year":"1992","unstructured":"Guisewite, G. and P.M. Pardalos (1992), A polynomial time solvable concave network flow problem,Network 23, 143?147.","journal-title":"Network"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Guisewite, G. and P.M. Pardalos (1993), Complexity issues in nonconvex network flow problems, inComplexity in Numerical Optimization, ed. P.M. Pardalos, World Scientific, 163?179.","DOI":"10.1142\/9789814354363_0009"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Holmberg, K. and H. Tuy (1993), A production-transportation problem with stochastic demands and concave production costs, Preprint, Department of Mathematics, Link\u00f6ping University. Submitted.","DOI":"10.1007\/978-3-642-46955-8_62"},{"key":"CR13","unstructured":"Klinz, B. and H. Tuy (1993), Minimum concave-cost network flow problems with a single nonlinear arc cost, inNetwork Optimization Problems, eds. P.M. pardalos and D.-Z. Du, World Scientific, 125?143."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra, H.W. Jr. (1983), Integer programming with a fixed number of variables,Mathematics of Operations Research 8, 538?548.","journal-title":"Mathematics of Operations Research"},{"key":"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?360.","journal-title":"Networks"},{"key":"CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and L.A. Wolsey (1988),Integer and Combinatorial Optimization, John Wiley & Sons, New York."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01581088","volume":"57","author":"P.M. Pardalos","year":"1992","unstructured":"Pardalos, P.M. and S.A. Vavasis (1992), Open questions in complexity theory for nonlinear optimization,Math. Prog. 57, 337?339.","journal-title":"Math. Prog."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"Tardos, E. (1985), A strongly polynomial minimum cost circulation algorithm,Combinatorika 5, 247?255.","journal-title":"Combinatorika"},{"key":"CR19","volume-title":"A decomposition method for the min concave-cost flow problem with a special structure","author":"P.T. Thach","year":"1987","unstructured":"Thach, P.T. (1987), A decomposition method for the min concave-cost flow problem with a special structure, Preprint, Institute of Mathematics, Hanoi."},{"key":"CR20","volume-title":"A dynamic programming method for min concave-cost flow problems on circuitless single source uncapacitated networks","author":"P.T. Thach","year":"1991","unstructured":"Thach, P.T. (1991), A dynamic programming method for min concave-cost flow problems on circuitless single source uncapacitated networks, Preprint, Institute of Mathematics, Hanoi."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00121300","volume":"2","author":"H. Tuy","year":"1992","unstructured":"Tuy, H. (1992), The complementary convex structure in global optimization,Journal of Global Optimization 2, 21?40.","journal-title":"Journal of Global Optimization"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/02331939208843778","volume":"24","author":"H. Tuy","year":"1992","unstructured":"Tuy, H. and B.T. Tam (1992), An efficient solution method for rank two quasiconcave minimization problems,Optimization 24, 43?56.","journal-title":"Optimization"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(93)90102-M","volume":"14","author":"H. Tuy","year":"1993","unstructured":"Tuy, H., N.D. Dan, and S. Ghannadan (1993), Strongly polynomial time algorithm for certain concave minimization problems on networks,Operations Research Letters 14, 99?109.","journal-title":"Operations Research Letters"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/02331939308843882","volume":"27","author":"H. Tuy","year":"1993","unstructured":"Tuy, H., S. Ghannadan, A. Migdalas, and P. V\u00e4rbrand (1993), Strongly polynomial algorithm for a production-transportation problem with concave production cost,Optimization 27, 205?228.","journal-title":"Optimization"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Tuy, H., S. Ghannadan, A. Migdalas, and P. V\u00e4rbrand (1993), Strongly polynomial algorithms for two special minimum concave-cost network flow problems,Optimization (to appear).","DOI":"10.1080\/02331939308843882"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Tuy, H., S. Ghannadan, A. Migdalas, and P. V\u00e4rbrand (1993), Strongly polynomial algorithm for a production-transportation problem with a fixed number of nonlinear variables,Mathematical Programming (to appear).","DOI":"10.1080\/02331939308843882"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/opre.17.2.262","volume":"17","author":"A.F. Veinott","year":"1969","unstructured":"Veinott, A.F. (1969), Minimum concave-cost solution of Leontiev substitution models of multifacility inventory systems,Operations Research 17, 262?291.","journal-title":"Operations Research"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1959","unstructured":"Wagner, H.M., and T.M. Whitin (1959), Dynamic version of the economic lot size model,Management Science 5, 89?96.","journal-title":"Management Science"},{"key":"CR29","first-page":"29","volume":"28","author":"S.W. Wallace","year":"1986","unstructured":"Wallace, S.W. (1986), Decomposition of the requirement space of a transportation problem into polyhedral cones,Mathematical Programming 28, 29?47.","journal-title":"Mathematical Programming"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W.I. Zangwill","year":"1968","unstructured":"Zangwill, W.I. (1968), Minimum concave cost flows in certain networks,Management Science 14, 429?450.","journal-title":"Management Science"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"W.I. Zangwill","year":"1969","unstructured":"Zangwill, W.I. (1969) A backlogging model and a multi-echelon model on a dynamic lot size production system?a network approach,Management Science 15, 509?527.","journal-title":"Management Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096764.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01096764\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T16:19:24Z","timestamp":1705940364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01096764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01096764"],"URL":"https:\/\/doi.org\/10.1007\/bf01096764","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}