Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (Q3875704): 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:10, 5 March 2024

scientific article
Language Label Description Also known as
English
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
scientific article

    Statements

    Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (English)
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    set covering algorithms
    0 references
    cutting planes, heuristics
    0 references
    subgradient optimization
    0 references
    computational study
    0 references
    implementation
    0 references
    computational testing
    0 references
    prime covers
    0 references
    lower bounds
    0 references
    implicit enumeration
    0 references
    branching rules
    0 references
    branch and bound
    0 references
    conditional bounds
    0 references
    random test problems
    0 references
    comparison of algorithms
    0 references