Strongly polynomial time algorithms for certain concave minimization problems on networks

A parametric method is proposed for solving a special production — transportation problem with two factories, and the minimum concave cost flow problem on a single source uncapacitated network with a single nonlinear arc cost. The resulting algorithms are strongly polynomial. The algorithm for the n...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1993-09, Vol.14 (2), p.99-109
Main Authors: Tuy, Hoang, Dinh Dan, Nguyen, Ghannadan, Saied
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
minimum concave cost flow problem
Operational research and scientific management
Operational research. Management science
parametric method
production-transportation problem
single nonlinear arc cost
single source uncapacitated network
strongly polynomial algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A parametric method is proposed for solving a special production — transportation problem with two factories, and the minimum concave cost flow problem on a single source uncapacitated network with a single nonlinear arc cost. The resulting algorithms are strongly polynomial. The algorithm for the network flow problem is an improved version of an earlier polynomial algorithm of Guisewite and Pardalos.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(93)90102-M