Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191)

From MaRDI portal
Revision as of 20:00, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Solving convex MINLP optimization problems using a sequential cutting plane algorithm
scientific article

    Statements

    Solving convex MINLP optimization problems using a sequential cutting plane algorithm (English)
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    convex programming
    0 references
    branch and bound
    0 references
    cutting plane algorithms
    0 references
    mixed integer nonlinear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers