An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.03.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090979038 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 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
