Variants of the Hungarian method for solving linear programming problems

DOI10.1080/02331938908843416zbMATH Open0679.90035OpenAlexW2015435283MaRDI QIDQ4729607FDOQ4729607

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

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

zbMATH Keywords

primal-dual algorithmHungarian methodcriss-cross method

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Title not available (Why is that?)
• New Finite Pivoting Rules for the Simplex Method
• A finite crisscross method for oriented matroids
• A convergent criss-cross method
• The Criss-Cross Method for Solving Linear Programming Problems
• Some Empirical Tests of the Criss-Cross Method

Cited In (7)

• Title not available (Why is that?)
• 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)