A branch-and-bound based method for solving monotone optimization problems (Q2501119)
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 5051217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound based method for solving monotone optimization problems |
scientific article; zbMATH DE number 5051217 |
Statements
A branch-and-bound based method for solving monotone optimization problems (English)
0 references
4 September 2006
0 references
global optimization
0 references
monotone optimization
0 references
branch-and-bound method
0 references
partition
0 references
convexification
0 references
local search
0 references
0 references
0 references
0.9277598
0 references
0.9057396
0 references
0.90277386
0 references
0.90261555
0 references
0.8938394
0 references
0.8938146
0 references
0.88786185
0 references
0.8855676
0 references
