Adjacent extreme flows and application to min concave cost flow problems
From MaRDI portal
Publication:3853462
DOI10.1002/net.3230090202zbMath0419.90078OpenAlexW2172121397MaRDI QIDQ3853462
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090202
network programmingcomputational experimentstest problemsnetwork flowsflow polyhedronsingle sourceadjacent extreme flowscapacited networksenumerating algorithmminimum concave cost flow problemsmulticommodity transportation problemsneighboring extreme flowsset of sinksuncapacited networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Enumerative techniques for solving some nonconvex global optimization problems, A decomposition method for the min concave cost flow problem with a staircase structure, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, An algorithm for the min concave cost flow problem, The interactive fixed charge inhomogeneous flows optimization problem, A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure, Global search algorithms for minimum concave-cost network flow problems, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Concave cost minimization on networks, 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, Identifying the structure of cycling in ecosystems, Parallel computing in nonconvex programming, Characterization of all optimal solutions and parametric maximal mows in networks, Strongly polynomial algorithm for two special minimum concave cost network flow problems, Global and local search algorithms for concave cost transshipment problems
Cites Work
