Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383)

From MaRDI portal
Revision as of 13:16, 8 July 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
Undercover: a primal MINLP heuristic exploring a largest sub-MIP
scientific article

    Statements

    Undercover: a primal MINLP heuristic exploring a largest sub-MIP (English)
    0 references
    0 references
    0 references
    2 June 2014
    0 references
    primal heuristic
    0 references
    mixed-integer nonlinear programming
    0 references
    large neighborhood search
    0 references
    mixed-integer quadratically constrained programming
    0 references
    nonconvex optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references