The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
From MaRDI portal
Publication:1804581
DOI10.1007/BF01096764zbMath0833.90039MaRDI QIDQ1804581
Hoang Tuy, Athanasios Migdalas, Peter Värbrand, Saied Ghannadan
Publication date: 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
parametric method; strongly polynomial algorithm; minimum concave cost network flow; fixed number of sources; nonlinear arc costs
90C60: Abstract computational complexity for mathematical programming problems
90B10: Deterministic network models in operations research
Related Items
An algorithm for a concave production cost network flow problem, Minimizing a linear multiplicative-type function under network flow constraints, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
Cites Work
- Unnamed Item
- Unnamed Item
- Open questions in complexity theory for numerical optimization
- A strongly polynomial minimum cost circulation algorithm
- An algorithm for the min concave cost flow problem
- The complementary convex structure in global optimization
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- A production-transportation problem with stochastic demand and concave production costs
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Integer Programming with a Fixed Number of Variables
- On a routing problem
- Decomposing the requirement space of a transporation problem into polyhedral cones
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Adjacent extreme flows and application to min concave cost flow problems
- An efficient solution method for rank two quasiconcave minimization problems
- Network Optimization Problems: Algorithms, Applications and Complexity
- A polynomial time solvable concave network flow problem
- Minimum Concave Cost Flows in Certain Networks
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem