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

From MaRDI portal
Revision as of 22:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (English)
    0 references
    DOI
    10.1057/jors.1992.71
    0 references
    publication date
    16 January 1993
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    90-08
    0 references
    90C35
    0 references
    zbMATH DE Number
    90327
    0 references
    zbMATH Keywords
    heuristics
    0 references
    cutting plane/branch-and-bound algorithm
    0 references
    node packing
    0 references
    OpenAlex ID
    W2066554880
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4018533&oldid=32004662"
    Powered by MediaWiki