Variants of the Hungarian method for solving linear programming problems

DOI10.1080/02331938908843416zbMath0679.90035OpenAlexW2015435283MaRDI QIDQ4729607

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)

Related Items (5)

A new algorithm for quadratic programming ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• A finite crisscross method for oriented matroids
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• New Finite Pivoting Rules for the Simplex Method
• Some Empirical Tests of the Criss-Cross Method

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