RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039)

From MaRDI portal
Revision as of 14:54, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5269118
Language Label Description Also known as
English
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(&lt;Special Issue&gt;the 50th Anniversary of the Operations Research Society of Japan)
scientific article; zbMATH DE number 5269118

    Statements

    RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(&lt;Special Issue&gt;the 50th Anniversary of the Operations Research Society of Japan) (English)
    0 references
    0 references
    0 references
    29 April 2008
    0 references
    combinatorial optimization
    0 references
    set covering problem
    0 references
    linear programming
    0 references
    Lagrangian relaxation
    0 references
    subgradient method
    0 references
    heuristic algorithm
    0 references

    Identifiers