scientific article; zbMATH DE number 4027164

MaRDI QIDQ3768671zbMATH OpenFDO

Authors Tamás Terlaky, Emil Klafszky

Publication date 1986

zbMATH Keywords

convergent criss-cross methodHungarian Method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Variants of the Hungarian method for solving linear programming problems
• New variants of finite criss-cross pivot algorithms for linear programming
• scientific article; zbMATH DE number 1160769
• scientific article; zbMATH DE number 3934764
• scientific article; zbMATH DE number 5011461

Cited in

(8)

• New variants of finite criss-cross pivot algorithms for linear programming
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• scientific article; zbMATH DE number 3900488 (Why is no real title available?)
• A convergent criss-cross method
• scientific article; zbMATH DE number 3934764 (Why is no real title available?)
• New purification algorithms for linear programming
• A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
• Variants of the Hungarian method for solving linear programming problems

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 Q3768671)