{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:57Z","timestamp":1759847997425},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0167-6377(93)90102-m","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"99-109","source":"Crossref","is-referenced-by-count":21,"title":["Strongly polynomial time algorithms for certain concave minimization problems on networks"],"prefix":"10.1016","volume":"14","author":[{"given":"Hoang","family":"Tuy","sequence":"first","affiliation":[]},{"given":"Nguyen","family":"Dinh Dan","sequence":"additional","affiliation":[]},{"given":"Saied","family":"Ghannadan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1987","series-title":"Data Structures and Algorithms","author":"Aho","key":"10.1016\/0167-6377(93)90102-M_BIB1"},{"key":"10.1016\/0167-6377(93)90102-M_BIB2","unstructured":"S. Cosares and D.S. Hochbaum, \u201cStrongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources\u201d, to appear in Math. Oper. Res."},{"key":"10.1016\/0167-6377(93)90102-M_BIB3","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","article-title":"On nonlinear fractional programming","volume":"13","author":"Dinkelbach","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(93)90102-M_BIB4","first-page":"53","article-title":"The solution of a special quadratic programming problem","volume":"8","author":"Forgo","year":"1975","journal-title":"Szigma"},{"key":"10.1016\/0167-6377(93)90102-M_BIB5","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"year":"1980","series-title":"Linear Programming Methods","author":"Gabasov","key":"10.1016\/0167-6377(93)90102-M_BIB6"},{"key":"10.1016\/0167-6377(93)90102-M_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230230208","article-title":"A polynomial time solvable concave network flow problem","volume":"23","author":"Guisewite","year":"1993","journal-title":"Networks"},{"key":"10.1016\/0167-6377(93)90102-M_BIB8","series-title":"Network Optimization Problems","first-page":"125","article-title":"Minimum concave cost network flow problems with a single nonlinear arc cost","author":"Klinz","year":"1993"},{"key":"10.1016\/0167-6377(93)90102-M_BIB9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01580893","article-title":"Linear multiplicative programming","volume":"56","author":"Konno","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(93)90102-M_BIB10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00120666","article-title":"Parametric simplex algorithm for solving a class of nonconvex minimization problems","volume":"1","author":"Konno","year":"1991","journal-title":"J. Global Optimization"},{"key":"10.1016\/0167-6377(93)90102-M_BIB11","series-title":"Recent Advances in Global Optimization","first-page":"259","article-title":"Minimizing and maximizing the product of linear fractional functions","author":"Konno","year":"1992"},{"year":"1983","series-title":"Linear Programming","author":"Murty","key":"10.1016\/0167-6377(93)90102-M_BIB12"},{"key":"10.1016\/0167-6377(93)90102-M_BIB13","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/02331939008843615","article-title":"Polynomial time algorithms for some classes of nonconvex quadratic problems","volume":"21","author":"Pardalos","year":"1990","journal-title":"Optimization"},{"key":"10.1016\/0167-6377(93)90102-M_BIB14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","article-title":"Quadratic programming with one negative eigenvalue is NP-hard","volume":"1","author":"Pardalos","year":"1991","journal-title":"J. Global Optimization"},{"key":"10.1016\/0167-6377(93)90102-M_BIB15","first-page":"136","article-title":"On a location problem","volume":"3","author":"Thieu","year":"1976","journal-title":"Tap ch\u00ed To\u00e1nhoc II"},{"key":"10.1016\/0167-6377(93)90102-M_BIB16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/02331939208843778","article-title":"An efficient solution method for rank two quasiconcave minimization problems","volume":"24","author":"Tuy","year":"1990","journal-title":"Optimization"},{"key":"10.1016\/0167-6377(93)90102-M_BIB17","series-title":"Optimization","article-title":"Minimizing the sum of a convex function and a specially structured nonconvex function","author":"Tuy","year":"1991"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390102M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390102M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:51:59Z","timestamp":1552902719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390102M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["016763779390102M"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90102-m","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}