Strongly polynomial time algorithms for certain concave minimization problems on networks
References (17)
- et al.
Data Structures and Algorithms
(1987) - S. Cosares and D.S. Hochbaum, “Strongly polynomial algorithms for the quadratic transportation problem with a fixed...
On nonlinear fractional programming
Management Sci.
(1967)The solution of a special quadratic programming problem
Szigma
(1975)- et al.
Fibonacci heaps and their uses in improved network optimization algorithms
- et al.
Linear Programming Methods
(1980) - et al.
A polynomial time solvable concave network flow problem
Networks
(1993) - et al.
Minimum concave cost network flow problems with a single nonlinear arc cost
There are more references available in the full text version of this article.
Cited by (17)
A general purpose exact solution method for mixed integer concave minimization problems
2023, European Journal of Operational ResearchBounds for global optimization of capacity expansion and flow assignment problems
2000, Operations Research LettersMinimizing a linear multiplicative-type function under network flow constraints
1997, Operations Research LettersA strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
1996, Mathematical Programming, Series BA discussion on non-convex optimization problems arising in supply chain design and finance
2023, Advancement in Business Analytics Tools for Higher Financial Performance
Copyright © 1993 Published by Elsevier B.V.