A competitive (dual) simplex method for the assignment problem (Q3730345): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Methods for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch Conjecture for Dual Transportation Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces of dual transportation polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating basis algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Properties of the Network Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dual simplex algorithms for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the simplex algorithm for networks and generalized networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01580579 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047029951 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:11, 30 July 2024

scientific article
Language Label Description Also known as
English
A competitive (dual) simplex method for the assignment problem
scientific article

    Statements

    A competitive (dual) simplex method for the assignment problem (English)
    0 references
    0 references
    1986
    0 references
    signature
    0 references
    worst case complexity
    0 references
    simplex method
    0 references
    linear assignment
    0 references
    new pivot choice rules
    0 references
    dual simplex method
    0 references
    average number of pivots
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references