Anti-stalling pivot rules for the network simplex algorithm
From MaRDI portal
Recommendations
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
- A new pivot selection rule for the network simplex algorithm
- A practical anti-degeneracy row selection technique in network linear programming
Cites work
Cited in
(12)- 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
- Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
- On the simplex algorithm for networks and generalized networks
- 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
- On the number of degenerate simplex pivots
- On the number of degenerate simplex pivots
- New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels
This page was built for publication: Anti-stalling pivot rules for the network simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470267)
