Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631)
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: Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem |
scientific article; zbMATH DE number 1506896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem |
scientific article; zbMATH DE number 1506896 |
Statements
Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (English)
0 references
27 January 2004
0 references
multiple-criteria decision making
0 references
efficient set
0 references
global optimization
0 references
branch-and-bound methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
