Decomposition branch and bound algorithm for optimization problems over efficient sets (Q1008773)
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: Decomposition branch and bound algorithm for optimization problems over efficient sets |
scientific article; zbMATH DE number 5535062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition branch and bound algorithm for optimization problems over efficient sets |
scientific article; zbMATH DE number 5535062 |
Statements
Decomposition branch and bound algorithm for optimization problems over efficient sets (English)
0 references
30 March 2009
0 references
nonconvex programming
0 references
multi-criteria optimization
0 references
optimization over efficient set
0 references
reverse convex constraint
0 references
branch and bound
0 references
decomposition
0 references
0.8353150486946106
0 references
0.8308582305908203
0 references
0.8253887891769409
0 references
0.8229357004165649
0 references
