Pages that link to "Item:Q3990557"
From MaRDI portal
The following pages link to The Scaling Network Simplex Algorithm (Q3990557):
Displaying 18 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- A computational comparison of the network simplex method with the dual affine scaling method (Q806669) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- An \(O(nm)\)-time network simplex algorithm for the shortest path problem (Q2770116) (← links)
- A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
- Clustering for faster network simplex pivots (Q4488857) (← links)
- The Simplex Algorithm Is NP-Mighty (Q4629975) (← links)
- An affine scaling method for solving network flow problems (Q4648994) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- Scaling: a canonical design problem for networks (Q5423843) (← links)
