Pages that link to "Item:Q5661700"
From MaRDI portal
The following pages link to Some Empirical Tests of the Criss-Cross Method (Q5661700):
Displaying 9 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- A finite crisscross method for oriented matroids (Q1073036) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) (← links)
- A convergent criss-cross method (Q3703581) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- Variants of the Hungarian method for solving linear programming problems (Q4729607) (← links)