Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490)

From MaRDI portal
Revision as of 09:32, 20 June 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
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
scientific article

    Statements

    Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (English)
    0 references
    0 references
    0 references
    15 September 2016
    0 references