Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AMIGO / rank | |||
Normal rank | |||
Revision as of 12:13, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods |
scientific article |
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
