The singly constrained assignment problem: An AP basis algorithm (Q1908532)

From MaRDI portal
Revision as of 09:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The singly constrained assignment problem: An AP basis algorithm
scientific article

    Statements

    title
    The singly constrained assignment problem: An AP basis algorithm (English)
    0 references
    DOI
    10.1007/BF01300862
    0 references
    author
    Farin Mohammadi
    0 references
    Jeffrey L. Kennington
    0 references
    publication date
    31 March 1996
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    90B80
    0 references
    90C35
    0 references
    90C05
    0 references
    90C09
    0 references
    zbMATH DE Number
    849061
    0 references
    zbMATH Keywords
    specialized primal simplex algorithm
    0 references
    near optimal integer solutions
    0 references
    OpenAlex ID
    W1993032505
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1908532&oldid=36880963"
    Powered by MediaWiki