Computing compromise solutions: On the connections between compromise programming and composite programming (Q2467390)
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: Computing compromise solutions: On the connections between compromise programming and composite programming |
scientific article; zbMATH DE number 5228843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing compromise solutions: On the connections between compromise programming and composite programming |
scientific article; zbMATH DE number 5228843 |
Statements
Computing compromise solutions: On the connections between compromise programming and composite programming (English)
0 references
21 January 2008
0 references
compromise programming
0 references
composite metric
0 references
\(p\)-norms
0 references
economic optimization
0 references
0.8399028778076172
0 references
0.7941708564758301
0 references
0.7937602400779724
0 references
0.788547694683075
0 references
0.7782350778579712
0 references
