A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions (Q3388290)
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 7344267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions |
scientific article; zbMATH DE number 7344267 |
Statements
A BRANCH-AND-BOUND ALGORITHM FOR A PSEUDO-BOOLEAN OPTIMIZATION PROBLEM WITH BLACK-BOX FUNCTIONS (English)
0 references
5 May 2021
0 references
pseudo-Boolean optimization problem
0 references
branch-and-bound method
0 references
constrained pseudo-Boolean optimization problem
0 references
0.7571994662284851
0 references
0.7529485821723938
0 references
