Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects |
scientific article; zbMATH DE number 6627621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects |
scientific article; zbMATH DE number 6627621 |
Statements
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (English)
0 references
15 September 2016
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.8302910327911377
0 references
0.8075742125511169
0 references
0.7979669570922852
0 references
0.7897371649742126
0 references
