A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (Q2899069)
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 6060482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme |
scientific article; zbMATH DE number 6060482 |
Statements
28 July 2012
0 references
multiobjective integer programming
0 references
efficient solution: weight space decomposition
0 references
nondominated extreme point
0 references
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (English)
0 references
0.8664484620094299
0 references
0.8501864075660706
0 references
0.8182691335678101
0 references
0.8139453530311584
0 references
