On the convergence of two branch-and-bound algorithms for nonconvex programming problems (Q1149236)

From MaRDI portal
Revision as of 00:14, 14 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
On the convergence of two branch-and-bound algorithms for nonconvex programming problems
scientific article

    Statements

    On the convergence of two branch-and-bound algorithms for nonconvex programming problems (English)
    0 references
    0 references
    1982
    0 references
    convergence property
    0 references
    branch-and-bound algorithms
    0 references
    nonconvex programming problems
    0 references
    global minimum
    0 references

    Identifiers