Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823)

From MaRDI portal
Revision as of 02:57, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59400258, #quickstatements; #temporary_batch_1710982311091)
scientific article
Language Label Description Also known as
English
Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
scientific article

    Statements

    Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (English)
    0 references
    11 December 2014
    0 references
    0 references
    bilevel programming
    0 references
    nonconvex inner problem
    0 references
    branch and bound
    0 references
    0 references
    0 references