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

From MaRDI portal
Revision as of 00:58, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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
    0 references
    interval arithmetic
    0 references
    constraint propagation
    0 references
    numerical constrained optimization
    0 references
    numerical constraint satisfaction
    0 references
    interval-based solver
    0 references
    branch and bound algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references