Variants of the Hungarian method for solving linear programming problems

DOI10.1080/02331938908843416MaRDI QIDQ4729607zbMATH OpenOpenAlexFDO

Authors Tamás Terlaky, Emil Klafszky

Publication date 1989

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938908843416

zbMATH Keywords

primal-dual algorithmHungarian methodcriss-cross method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4027164
• New algorithms for linear programming
• scientific article; zbMATH DE number 5011461
• scientific article; zbMATH DE number 4016589
• scientific article; zbMATH DE number 3934764

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A convergent criss-cross method
• A finite crisscross method for oriented matroids
• New Finite Pivoting Rules for the Simplex Method
• Some Empirical Tests of the Criss-Cross Method
• The Criss-Cross Method for Solving Linear Programming Problems

Cited in

(7)

• scientific article; zbMATH DE number 4027164 (Why is no real title available?)
• A new algorithm for quadratic programming
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Some generalizations of the criss-cross method for quadratic programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• Algorithm of partial basic variables to solve LP problem

This page was built for publication: Variants of the Hungarian method for solving linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729607)