THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS (Q4742560)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3797498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS |
scientific article; zbMATH DE number 3797498 |
Statements
THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS (English)
0 references
1982
0 references
computational efficiency
0 references
efficiency of branch and bound algorithms
0 references
tightness of upper and lower bounding functions
0 references
tightning
0 references
lower bound test
0 references
dominance test
0 references
