The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
From MaRDI portal
Publication:1804581
DOI10.1007/BF01096764zbMATH Open0833.90039OpenAlexW2055544843MaRDI QIDQ1804581FDOQ1804581
Authors: Hoang Tuy, Saied Ghannadan, Athanasios Migdalas, Peter Värbrand 
Publication date: 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096764
Recommendations
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- Strong polynomial-time solvability of a minimum concave cost network flow problem.
- scientific article; zbMATH DE number 3850794
- A polynomial time solvable concave network flow problem
- On minimum concave cost network flow problems
parametric methodstrongly polynomial algorithmminimum concave cost network flowfixed number of sourcesnonlinear arc costs
Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- On a routing problem
- Title not available (Why is that?)
- Integer Programming with a Fixed Number of Variables
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A production-transportation problem with stochastic demand and concave production costs
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A strongly polynomial minimum cost circulation algorithm
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum Concave Cost Flows in Certain Networks
- Adjacent extreme flows and application to min concave cost flow problems
- An efficient solution method for rank two quasiconcave minimization problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Open questions in complexity theory for numerical optimization
- Network Optimization Problems: Algorithms, Applications and Complexity
- An algorithm for the min concave cost flow problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- The complementary convex structure in global optimization
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- A polynomial time solvable concave network flow problem
- Decomposing the requirement space of a transporation problem into polyhedral cones
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Complexity issues in nonconvex network flow problems
Cited In (22)
- Complexity and algorithms for nonlinear optimization problems
- Subdeterminants and Concave Integer Quadratic Programming
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- A decomposition method for the min concave cost flow problem with a staircase structure
- Strong polynomial-time solvability of a minimum concave cost network flow problem.
- A concavity result for network design problems
- An algorithm for a concave production cost network flow problem
- Title not available (Why is that?)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Title not available (Why is that?)
- Minimum cost flow in a network with an overestimated arc capacity
- Title not available (Why is that?)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
- 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
- Minimum concave cost flow over a grid network
- Algorithms and Computation
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- Analysis of a flow problem with fixed charges
- Title not available (Why is that?)
This page was built for publication: The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804581)
