Pages that link to "Item:Q3990557"
From MaRDI portal
The following pages link to The Scaling Network Simplex Algorithm (Q3990557):
Displaying 7 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← 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)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
