Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389)
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: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods |
scientific article; zbMATH DE number 5869772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods |
scientific article; zbMATH DE number 5869772 |
Statements
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (English)
0 references
24 March 2011
0 references
nonlinear biobjective optimization
0 references
efficient set
0 references
outer approximation
0 references
interval analysis
0 references
branch-and-bound method
0 references
discarding tests
0 references
continuous location
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8655493259429932
0 references
0.8432642817497253
0 references
0.7987644672393799
0 references
0.7773446440696716
0 references
0.7651023864746094
0 references
