Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem (Q5545156)

From MaRDI portal
Revision as of 23:22, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3257017
Language Label Description Also known as
English
Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
scientific article; zbMATH DE number 3257017

    Statements

    title
    Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem (English)
    0 references
    author
    Jeremy F. Shapiro
    0 references
    publication date
    1968
    0 references
    zbMATH Keywords
    operations research
    0 references

    Identifiers

    DOI
    10.1287/opre.16.1.103
    0 references
    zbMATH DE Number
    3257017
    0 references
    OpenAlex ID
    W2113442915
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5545156&oldid=32370659"
    Powered by MediaWiki