Strongly polynomial algorithm for two special minimum concave cost network flow problems

DOI10.1080/02331939508844033zbMath0817.65049MaRDI QIDQ4764587

Hoang Tuy, Athanasios Migdalas, Peter Värbrand, Saied Ghannadan

Publication date: 6 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844033

zbMATH Keywords

complexity; global optimization; concave minimization; network flow problem; production-transportation problem; strongly polynomial time algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90B10: Deterministic network models in operations research

65Y20: Complexity and performance of numerical algorithms

Related Items

A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

Cites Work

• Unnamed Item
• Open questions in complexity theory for numerical optimization
• 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
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Dynamic Version of the Economic Lot Size Model
• On a Class of Capacitated Transportation Problems
• 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
• 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
• The steiner problem in graphs
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem