STRONGLY POLYNOMIAL-TIME ALGORITHMS FOR CERTAIN CONCAVE MINIMIZATION PROBLEMS ON NETWORKS

Authors
TUY H DAN ND GHANNADAN S
Citation
H. Tuy et al., STRONGLY POLYNOMIAL-TIME ALGORITHMS FOR CERTAIN CONCAVE MINIMIZATION PROBLEMS ON NETWORKS, Operations research letters, 14(2), 1993, pp. 99-109
Citations number
17
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
14
Issue
2
Year of publication
1993
Pages
99 - 109
Database
ISI
SICI code
0167-6377(1993)14:2<99:SPAFCC>2.0.ZU;2-O
Abstract
A parametric method is proposed for solving a special production - tra nsportation problem with two factories, and the minimum concave cost f low problem on a single source uncapacitated network with a single non linear arc cost. The resulting algorithms are strongly polynomial. The algorithm for the network flow problem is an improved version of an e arlier polynomial algorithm of Guisewite and Pardalos.