New lower bounds for bin packing problems with conflicts (Q976310)

From MaRDI portal
Revision as of 21:42, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New lower bounds for bin packing problems with conflicts
scientific article

    Statements

    title
    New lower bounds for bin packing problems with conflicts (English)
    0 references
    author
    Ali Khanafer
    0 references
    François Clautiaux
    0 references
    El-Ghazali Talbi
    0 references
    publication date
    11 June 2010
    0 references
    zbMATH Keywords
    bin packing with conflicts
    0 references
    Knapsack problem
    0 references
    lower bounds
    0 references
    chordal graphs
    0 references
    tree-decomposition
    0 references
    dual-feasible functions
    0 references
    cites work
    Packing problems
    0 references
    Q3347319
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C35
    0 references
    90B80
    0 references
    zbMATH DE Number
    5720318
    0 references
    OpenAlex ID
    W2049071849
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q976310&oldid=35174253"
    Powered by MediaWiki