Computing compromise sets in polyhedral framework (Q1585508)
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 1531165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing compromise sets in polyhedral framework |
scientific article; zbMATH DE number 1531165 |
Statements
Computing compromise sets in polyhedral framework (English)
0 references
16 November 2000
0 references
compromise programming
0 references
convexity
0 references
\(p\)-norms
0 references
compromise set
0 references
multicriteria problems
0 references
monotonicity
0 references
0.8548851013183594
0 references
0.759971022605896
0 references
0.7556796669960022
0 references
0.754775881767273
0 references
