scientific article; zbMATH DE number 5011461
From MaRDI portal
Publication:3372777
Recommendations
- New variants of finite criss-cross pivot algorithms for linear programming
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- New algorithms for linear programming
- The Criss-Cross Method for Solving Linear Programming Problems
- scientific article; zbMATH DE number 1445590
- Performance evaluation of a family of criss-cross algorithms for linear programming
- scientific article; zbMATH DE number 883355
- scientific article; zbMATH DE number 3934764
Cited in
(11)- scientific article; zbMATH DE number 4027164 (Why is no real title available?)
- The Criss-Cross Method for Solving Linear Programming Problems
- Criss-cross methods: A fresh view on pivot algorithms
- Variants of the Hungarian method for solving linear programming problems
- scientific article; zbMATH DE number 3934764 (Why is no real title available?)
- A convergent criss-cross method
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- Performance evaluation of a family of criss-cross algorithms for linear programming
- New variants of finite criss-cross pivot algorithms for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372777)
