On the simplex algorithm for networks and generalized networks
From MaRDI portal
Publication:3722234
DOI10.1007/BFb0121050zbMath0592.90031OpenAlexW1532372175MaRDI QIDQ3722234
Publication date: 1985
Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121050
simplex algorithmgeneralized network flow problemlexicographylower and upper bounds on the variables
Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels ⋮ Affirmative action algorithms ⋮ A competitive (dual) simplex method for the assignment problem ⋮ Anti-stalling pivot rules for the network simplex algorithm ⋮ A polynomial time primal network simplex algorithm for minimum cost flows ⋮ A new pivot selection rule for the network simplex algorithm ⋮ A simplex algorithm for a class of Leontief flow problems ⋮ Improving bipartite graph edit distance approximation using various search strategies ⋮ Unnamed Item ⋮ Flow constrained minimum cost flow problem ⋮ Unnamed Item ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Finding minimum-cost flows by double scaling ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ Polynomial dual network simplex algorithms ⋮ A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses ⋮ A strongly polynomial simplex method for the linear fractional assignment problem ⋮ Active set algorithms for isotonic regression; a unifying framework ⋮ A note on a generalized network flow model for manufacturing process ⋮ Solving the drift control problem ⋮ Studies of lexicography in the generalized network simplex method ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis
