Branch-and-cut for complementarity-constrained optimization (Q482112)

From MaRDI portal
Revision as of 09:44, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Branch-and-cut for complementarity-constrained optimization
scientific article

    Statements

    Branch-and-cut for complementarity-constrained optimization (English)
    0 references
    0 references
    19 December 2014
    0 references
    complementarity
    0 references
    multiple-choice
    0 references
    special ordered set
    0 references
    mixed-integer programming
    0 references
    knapsack set
    0 references
    polyhedral method
    0 references
    branch-and-cut
    0 references

    Identifiers

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