On the complexity of integer programming (Q3922169)

From MaRDI portal
Revision as of 21:34, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On the complexity of integer programming
scientific article

    Statements

    title
    On the complexity of integer programming (English)
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    pseudopolynomial algorithms
    0 references
    knapsack problem
    0 references

    Identifiers

    DOI
    10.1145/322276.322287
    0 references
    zbMATH DE Number
    3735139
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3922169&oldid=22642210"
    Powered by MediaWiki