An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2014.03.016 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2014.03.016 / rank | |||
Normal rank | |||
Latest revision as of 00:08, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient procedure for finding best compromise solutions to the multi-objective assignment problem |
scientific article |
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
