On minimum concave cost network flow problems
From MaRDI portal
Recommendations
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- scientific article; zbMATH DE number 1163712
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
Cited in
(21)- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- Minimum-cost flows in unit-capacity networks
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- A concavity result for network design problems
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum concave cost flow over a grid network
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- scientific article; zbMATH DE number 4070604 (Why is no real title available?)
- scientific article; zbMATH DE number 1157097 (Why is no real title available?)
- scientific article; zbMATH DE number 1163712 (Why is no real title available?)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- scientific article; zbMATH DE number 1560355 (Why is no real title available?)
- scientific article; zbMATH DE number 5173820 (Why is no real title available?)
- Network transportation problem with concave cost functions of the flux on network edges and its applications
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
This page was built for publication: On minimum concave cost network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626256)
