The following pages link to (Q4308908):
Displaying 18 items.
- The sagitta method for solving linear programs (Q703904) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Topological obstructions for vertex numbers of Minkowski sums (Q1003631) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- Zonotopes with large 2D-cuts (Q1042447) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Computational techniques of the simplex method (Q1860337) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- (Q3137560) (← links)
- (Q3321827) (← links)
- (Q3484622) (← links)
- The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
- (Q4346077) (← links)
- The Simplex Algorithm Is NP-Mighty (Q4629975) (← links)
- A Comparison of the Original and Revised Simplex Methods (Q5378744) (← links)
- On Simplex Pivoting Rules and Complexity Theory (Q5418981) (← links)