A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533)

From MaRDI portal
Revision as of 20:43, 23 October 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 Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
scientific article

    Statements

    A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (English)
    0 references
    16 January 1993
    0 references
    heuristics
    0 references
    cutting plane/branch-and-bound algorithm
    0 references
    node packing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references