The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
From MaRDI portal
Publication:1804581
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
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A polynomial time solvable concave network flow problem
- A production-transportation problem with stochastic demand and concave production costs
- A strongly polynomial minimum cost circulation algorithm
- Adjacent extreme flows and application to min concave cost flow problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- An algorithm for the min concave cost flow problem
- An efficient solution method for rank two quasiconcave minimization problems
- Complexity issues in nonconvex network flow problems
- Decomposing the requirement space of a transporation problem into polyhedral cones
- Integer Programming with a Fixed Number of Variables
- Minimum Concave Cost Flows in Certain Networks
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Network Optimization Problems: Algorithms, Applications and Complexity
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On a routing problem
- Open questions in complexity theory for numerical optimization
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- The complementary convex structure in global optimization
Cited in
(22)- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
- Subdeterminants and concave integer quadratic programming
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- A concavity result for network design problems
- scientific article; zbMATH DE number 3952462 (Why is no real title available?)
- Algorithms and Computation
- scientific article; zbMATH DE number 4070604 (Why is no real title available?)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- Complexity and algorithms for nonlinear optimization problems
- A decomposition method for the min concave cost flow problem with a staircase structure
- Minimizing a linear multiplicative-type function under network flow constraints
- Strong polynomial-time solvability of a minimum concave cost network flow problem.
- scientific article; zbMATH DE number 3850794 (Why is no real title available?)
- Analysis of a flow problem with fixed charges
- An algorithm for a concave production cost network flow problem
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- scientific article; zbMATH DE number 1560355 (Why is no real title available?)
- Minimum concave cost flow over a grid network
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- Minimum cost flow in a network with an overestimated arc capacity
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
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)
