An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587)

From MaRDI portal
Revision as of 13:46, 13 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
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
scientific article

    Statements

    An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    accelerated algorithm
    0 references
    0-1 positive polynomial problems
    0 references
    cutting plane
    0 references
    linear set covering problem
    0 references
    heuristic solutions
    0 references
    computational results
    0 references
    nonlinear integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references