A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (Q2899132)

From MaRDI portal
Revision as of 14:43, 22 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 Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
scientific article

    Statements

    A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2012
    0 references
    bin packing problem with conflicts
    0 references
    branch and price
    0 references
    Lagrangean relaxation
    0 references
    maximal clique inequalities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references