Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535)

From MaRDI portal
Revision as of 19:18, 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
Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
scientific article

    Statements

    Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete optimization
    0 references
    branch and bound
    0 references
    graph theoretic relaxations
    0 references
    tree search algorithms
    0 references
    set-covering
    0 references
    set-partitioning
    0 references
    assignment relaxations
    0 references
    0 references