Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011)
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: Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach |
scientific article; zbMATH DE number 1912323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach |
scientific article; zbMATH DE number 1912323 |
Statements
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (English)
0 references
19 May 2003
0 references
multiple objective programming
0 references
max-ordering problems
0 references
ranking methods
0 references
combinatorial optimization
0 references
0 references
0 references
0.84623873
0 references
0.8455894
0 references
0.8437475
0 references
0.8350698
0 references
