Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007)

From MaRDI portal
Revision as of 00:52, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q246835)
scientific article
Language Label Description Also known as
English
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
scientific article

    Statements

    Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (English)
    0 references
    0 references
    0 references
    3 May 2010
    0 references
    global optimization
    0 references
    branch and bound
    0 references
    selection strategies
    0 references
    Lipschitz optimization
    0 references
    parallel branch and bound
    0 references

    Identifiers