Decomposition branch and bound algorithm for optimization problems over efficient sets (Q1008773)

From MaRDI portal
Revision as of 17:19, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decomposition branch and bound algorithm for optimization problems over efficient sets
scientific article

    Statements

    Decomposition branch and bound algorithm for optimization problems over efficient sets (English)
    0 references
    0 references
    30 March 2009
    0 references
    nonconvex programming
    0 references
    multi-criteria optimization
    0 references
    optimization over efficient set
    0 references
    reverse convex constraint
    0 references
    branch and bound
    0 references
    decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references