Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503)
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: Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming |
scientific article; zbMATH DE number 7046577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming |
scientific article; zbMATH DE number 7046577 |
Statements
Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (English)
0 references
23 April 2019
0 references
multiple objective programming
0 references
efficient extreme points
0 references
nondominated vertices
0 references
distributed processing
0 references
criterion cones
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7929438352584839
0 references
0.7918975949287415
0 references
0.7904571890830994
0 references
0.7896184325218201
0 references
