Anti-stalling pivot rules for the network simplex algorithm
From MaRDI portal
Publication:3470267
DOI10.1002/net.3230200108zbMath0694.90095MaRDI QIDQ3470267
Jianxiu Hao, Donald Goldfarb, Sheng-Roan Kai
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200108
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C05: Linear programming
Related Items
A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels, Efficient solutions for the bicriteria network flow problem, A practical anti-degeneracy row selection technique in network linear programming, The biobjective minimum cost flow problem, A network simplex algorithm with O(\(n\)) consecutive degenerate pivots, SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
Cites Work