A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571)

From MaRDI portal
Revision as of 22:52, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
scientific article

    Statements

    title
    A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (English)
    0 references
    author
    Abdelkader Sbihi
    0 references
    publication date
    22 January 2008
    0 references
    zbMATH Keywords
    sequential algorithm
    0 references

    Identifiers

    zbMATH DE Number
    5229102
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467571&oldid=2789819"
      Powered by MediaWiki