Strongly polynomial time algorithms for certain concave minimization problems on networks

Authors:
Hoang Tuy;Nguyen Dinh Dan;Saied Ghannadan
Affiliations:
Institute of Mathematics, P.O. Box 631, Hanoi, Vietnam and Department of Mathematics, Linköping Institute of Technology, S-581 83 Linköping, Sweden;Department of Applied Mathematics and Computer Science, Polytechnical Institute, Hanoi, Vietnam;Department of Mathematics, Linköping Institute of Technology, S-581 83 Linköping, Sweden
Venue:
Operations Research Letters
Year:
1993

Citing 5
Cited 2

Minimizing and maximizing the product of linear fractional functions

Recent advances in global optimization
Linear multiplicative programming

Mathematical Programming: Series A and B
Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources

Mathematics of Operations Research
Data Structures and Algorithms

Data Structures and Algorithms
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Bounds for global optimization of capacity expansion and flow assignment problems

Operations Research Letters
Minimizing a linear multiplicative-type function under network flow constraints

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.