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
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.