Network flow problems with one side constraint: A comparison of three solution methods
From MaRDI portal
Publication:1102172
DOI10.1016/0305-0548(88)90022-6zbMath0643.90023MaRDI QIDQ1102172
Publication date: 1988
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(88)90022-6
primal simplex algorithm; minimum cost network flow; Lagrangean approach; relaxation of the side constraint
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Related Items
A comprehensive simplex-like algorithm for network optimization and perturbation analysis, An improved branch and bound algorithm for minimum concave cost network flow problems, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Applications of the parametric programming procedure, On the equivalence of constrained and unconstrained flows, A hybrid algorithm for solving network flow problems with side constraints.
Uses Software