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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 14:51, 5 March 2024

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
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristics
    0 references
    cutting plane/branch-and-bound algorithm
    0 references
    node packing
    0 references