An algorithm for the min concave cost flow problem
From MaRDI portal
Publication:1142707
DOI10.1016/0377-2217(80)90109-5zbMath0439.90092OpenAlexW1996431511MaRDI QIDQ1142707
Claudio Sandi, Giorgio Gallo, Claudio Sodini
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90109-5
lower boundsbranch and bound procedureglobal optimumconcave costslinear relaxationsnetwork flow problemsmin concave cost flow problemone source-multiple destination problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, Enumerative techniques for solving some nonconvex global optimization problems, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, A decomposition method for the min concave cost flow problem with a staircase structure, A general purpose exact solution method for mixed integer concave minimization problems, Approximating some network design problems with node costs, A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure, An improved branch and bound algorithm for minimum concave cost network flow problems, Global search algorithms for minimum concave-cost network flow problems, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Probabilistic local search algorithms for concave cost transportation network problems, Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals, An algorithm for a concave production cost network flow problem, Strongly polynomial algorithm for two special minimum concave cost network flow problems, Global and local search algorithms for concave cost transshipment problems
Cites Work
- Adjacent extreme flows and application to min concave cost flow problems
- On building minimum cost communication networks
- Optimal Facility Location with Concave Costs
- On building minimum cost communication networks over time
- Minimum Concave Cost Flows in Certain Networks
- Minimum cost routing for static network models
- Unnamed Item
