Constructive dual methods for discrete programming (Q1101341)

From MaRDI portal
Revision as of 15:55, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constructive dual methods for discrete programming
scientific article

    Statements

    Constructive dual methods for discrete programming (English)
    0 references
    0 references
    1987
    0 references
    constructive dual methods
    0 references
    discrete programming
    0 references
    reduction of the feasibility set
    0 references
    no duality gap
    0 references
    relaxation approximation
    0 references
    knapsack problems
    0 references

    Identifiers