Pages that link to "Item:Q4729607"
From MaRDI portal
The following pages link to Variants of the Hungarian method for solving linear programming problems (Q4729607):
Displaying 5 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)