Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: COCONUT / rank | |||
Normal rank | |||
Revision as of 18:08, 29 February 2024
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
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
