{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:20:52Z","timestamp":1761708052709},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf02592091","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:10Z","timestamp":1175182390000},"page":"229-258","source":"Crossref","is-referenced-by-count":25,"title":["A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables"],"prefix":"10.1007","volume":"72","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\u00e4rbrand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592091_CR1","series-title":"Collaborative paper, bf CP-83-9","volume-title":"The Hirsch conjecture for dual transportation polyhedra","author":"M.L. Balinski","year":"1983","unstructured":"M.L. Balinski, \u201cThe Hirsch conjecture for dual transportation polyhedra,\u201d Collaborative paper, bf CP-83-9, IIASA, Laxenburg, Austria (1983)."},{"key":"BF02592091_CR2","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1977","unstructured":"M.S. Bazaraa and J.J. Jarvis,Linear Programming and Network Flows (Wiley, New York, 1977)."},{"key":"BF02592091_CR3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0167-6377(91)90042-N","volume":"10","author":"P.C. Chen","year":"1991","unstructured":"P.C. Chen and P. Hansen, \u201cOn-line and off-line vertex enumeration by adjacency lists,\u201dOperations Research Letters 10 (1991) 403\u2013409.","journal-title":"Operations Research Letters"},{"key":"BF02592091_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M.A. Efroymson","year":"1966","unstructured":"M.A. Efroymson and T.R. Ray, \u201cA branch and bound algorithm for plant location,\u201dOperations Research 14 (1966) 361\u2013368.","journal-title":"Operations Research"},{"key":"BF02592091_CR5","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","volume":"12","author":"E. Feldman","year":"1966","unstructured":"E. Feldman, F.A. Lehrer and T.L. Ray, \u201cWarehouse location under continuous economies of scale,\u201dManagement Science 12 (1966) 670\u2013684.","journal-title":"Management Science"},{"key":"BF02592091_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M. Florian","year":"1971","unstructured":"M. Florian and M. Klein, \u201cDeterministic production planning with concave costs and capacity constraints\u201d,Management Science 18 (1971) 12\u201320.","journal-title":"Management Science"},{"key":"BF02592091_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230230208","volume":"23","author":"G.M. Guisewite","year":"1990","unstructured":"G.M. Guisewite and P.M. Pardalos, \u201cA polynomial time solvable concave network flow problem,\u201dNetworks 23 (1990) 143\u2013147.","journal-title":"Networks"},{"key":"BF02592091_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G.M. Guisewite","year":"1990","unstructured":"G.M. Guisewite and P.M. Pardalos, \u201cMinimum concave cost network flow problems: applications, complexity and algorithms,\u201dAnnals of Operations Research 25 (1990) 75\u2013100.","journal-title":"Annals of Operations Research"},{"key":"BF02592091_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0377-2217(91)90189-3","volume":"55","author":"S.L. Hakimi","year":"1991","unstructured":"S.L. Hakimi and C.C. Kuo, \u201cOn a general network location-production-allocation problem,\u201dEuropean Journal of Operations Research 55 (1991) 31\u201345.","journal-title":"European Journal of Operations Research"},{"key":"BF02592091_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/96559.96597","volume":"37","author":"D.S. Hochbaum","year":"1990","unstructured":"D.S. Hochbaum and J.G. Shantikumar, \u201cConvex separable optimization is not much harder than linear optimization,\u201dJournal of the Association for Computing Machinery 37 (1990) 343\u2013362.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02592091_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization","author":"R. Horst","year":"1990","unstructured":"R. Horst and H. Tuy,Global Optimization (Springer, Berlin, 1990)."},{"key":"BF02592091_CR12","first-page":"55","volume":"12","author":"B.M. Khumawala","year":"1974","unstructured":"B.M. Khumawala and D.L. Kelly, \u201cWarehouse location with concave costs,\u201dINFOR 12 (1974) 55\u201365.","journal-title":"INFOR"},{"key":"BF02592091_CR13","first-page":"125","volume-title":"Network Optimization Problems","author":"B. Klinz","year":"1992","unstructured":"B. Klinz and H. Tuy, \u201cMinimum concave cost network flow problems with a single nonlinear arc cost,\u201d P.M. Pardalos and D.-Z. DuNetwork Optimization Problems, (World Scientific, Singapore, 1992) pp. 125\u2013143."},{"key":"BF02592091_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01580763","volume":"41","author":"H. Konno","year":"1988","unstructured":"H. Konno \u201cMinimum concave cost production system: a further generalization of multiechelon model,\u201dMathematical Programming 41 (1988) 185\u2013193.","journal-title":"Mathematical Programming"},{"key":"BF02592091_CR15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"P. Krarup","year":"1983","unstructured":"P. Krarup and P.M. Pruzan, \u201cThe simple plant location problem: survey and synthesis,\u201dEuropean Journal of Operations Research 12 (1983) 36\u201381.","journal-title":"European Journal of Operations Research"},{"key":"BF02592091_CR16","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"H.W. Lenstra Jr., \u201cInteger programming with a fixed number of variables,\u201dMathematics of Operations Research 8 (1983) 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592091_CR17","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.17.3.751","volume":"17","author":"L. Lov\u00e1sz","year":"1992","unstructured":"L. Lov\u00e1sz and H.E. Scarf, \u201cThe generalized basis reduction algorithm,\u201dMathematics of Operations Research 17 (1992) 751\u2013764.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592091_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"T.L. Magnanti and R.T. Wong, \u201cNetwork design and transportation planning: models and algorithms,\u201dTransportation Science 18 (1984) 1\u201355.","journal-title":"Transportation Science"},{"key":"BF02592091_CR19","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirowsky","year":"1983","unstructured":"A.S. Nemirowsky and D.D. Yudin,Problem Complexity and Method Efficiency in Optimization (Wiley, New York, 1983)."},{"key":"BF02592091_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"P.M. Pardalos and S.A. Vavasis, \u201cQuadratic programming with one negative eigenvalue is NP-hard,\u201dJournal of Global optimization 1 (1991) 15\u201322.","journal-title":"Journal of Global optimization"},{"key":"BF02592091_CR21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01581088","volume":"57","author":"P.M. Pardalos","year":"1992","unstructured":"P.M. Pardalos and S.A. Vavasis, \u201cOpen questions in complexity theory for nonlinear optimization,\u201dMathematical Programming 57 (1992) 337\u2013339.","journal-title":"Mathematical Programming"},{"key":"BF02592091_CR22","volume-title":"Mathematical Programming Structures and Algorithms","author":"J.F. Shapiro","year":"1979","unstructured":"J.F. Shapiro,Mathematical Programming Structures and Algorithms (Wiley, New York, 1979)."},{"key":"BF02592091_CR23","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, \u201cOptimal facility location with concave costs,\u201dOperations Research 22 (1974) 373\u2013382.","journal-title":"Operations Research"},{"key":"BF02592091_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013255.","journal-title":"Combinatorica"},{"key":"BF02592091_CR25","first-page":"101","volume-title":"Essays in Nonlinear Analysis and Optimization","author":"T.V. Thieu","year":"1987","unstructured":"T.V. Thieu, \u201cSolving the lay-out planning problem with concave cost\u201d, in:Essays in Nonlinear Analysis and Optimization (Institute of Mathematics, Hanoi, 1987) pp. 101\u2013110."},{"key":"BF02592091_CR26","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/02331938508843024","volume":"16","author":"H. Tuy","year":"1985","unstructured":"H. Tuy, \u201cConcave minimization under linear constraints with special structure,\u201dOptimization 16 (1985) 335\u2013352.","journal-title":"Optimization"},{"key":"BF02592091_CR27","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(93)90102-M","volume":"14","author":"H. Tuy","year":"1993","unstructured":"H. Tuy, N.D. Dan and S. Ghannadan, \u201cStrongly polynomial algorithms for certain concave minimization problems on networks,\u201dOperations Research Letters, 14 (1993) 99\u2013109.","journal-title":"Operations Research Letters"},{"key":"BF02592091_CR28","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/02331939308843882","volume":"27","author":"H. Tuy","year":"1992","unstructured":"H. Tuy, S. Ghannadan, A. Migdalas and P. V\u00e4rbrand, \u201cStrongly polynomial algorithm for a production-transportation problem with concave production costs,\u201dOptimization 27 (1992) 205\u2013228.","journal-title":"Optimization"},{"key":"BF02592091_CR29","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01096764","volume":"6","author":"H. Tuy","year":"1992","unstructured":"H. Tuy, S. Ghannadan, A. Migdalas and P. V\u00e4rbrand, \u201cMinimum concave cost network flow problems with a fixed number of nonlinear arc costs and sources,\u201dJournal of Global Optimization 6 (1992) 135\u2013151.","journal-title":"Journal of Global Optimization"},{"key":"BF02592091_CR30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/02331939508844033","volume":"32","author":"H. Tuy","year":"1995","unstructured":"H. Tuy, S. Ghannadan, A. Migdalas and P. V\u00e4rbrand, \u201cStrongly polynomial algorithm for two special minimum concave cost network flow problems,\u201dOptimization 32 (1995) 23\u201343.","journal-title":"Optimization"},{"key":"BF02592091_CR31","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/02331939208843778","volume":"24","author":"H. Tuy","year":"1992","unstructured":"H. Tuy and B.T. Tam, \u201cAn efficient solution method for rank two quasi-concave minimization problems,\u201dOptimization 24 (1992) 43\u201356.","journal-title":"Optimization"},{"key":"BF02592091_CR32","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1959","unstructured":"H.M. Wagner and T.M. Whitin, \u201cDynamic version of the economic lot size model,\u201dManagement Science 5 (1959) 89\u201396.","journal-title":"Management Science"},{"key":"BF02592091_CR33","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BFb0121124","volume":"28","author":"S.W. Wallace","year":"1986","unstructured":"S.W. Wallace, \u201cDecomposition of the requirement space of a transportation problem into polyhedral cones,\u201dMathematical Programming Study 28 (1986) 29\u201347.","journal-title":"Mathematical Programming Study"},{"key":"BF02592091_CR34","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill, \u201cA Backlogging Model and a multi-echelon model of a dynamic economic lot size production system\u2014a network approach,\u201dManagement Science 15 (1969) 509\u2013527.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592091\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF02592091"],"URL":"https:\/\/doi.org\/10.1007\/bf02592091","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}