An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019)
From MaRDI portal
!
WARNING
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 6654016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient procedure for finding best compromise solutions to the multi-objective assignment problem |
scientific article; zbMATH DE number 6654016 |
Statements
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (English)
0 references
17 November 2016
0 references
multi-objective assignment problem
0 references
compromise solutions
0 references
branch and bound
0 references
\(k\)-best algorithm
0 references
0 references
0 references
0 references
0.7738817930221558
0 references
0.7721952199935913
0 references
0.7659159302711487
0 references
0.7645941376686096
0 references
