Variants of the Hungarian method for solving linear programming problems (Q4729607): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1262208
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Emil Klafszky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331938908843416 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015435283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite crisscross method for oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Empirical Tests of the Criss-Cross Method / rank
 
Normal rank

Latest revision as of 10:35, 20 June 2024

scientific article; zbMATH DE number 4114368
Language Label Description Also known as
English
Variants of the Hungarian method for solving linear programming problems
scientific article; zbMATH DE number 4114368

    Statements

    Variants of the Hungarian method for solving linear programming problems (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    criss-cross method
    0 references
    Hungarian method
    0 references
    primal-dual algorithm
    0 references
    0 references