.png){kind=icon}
.png){kind=icon}
Return
On the multicriteria allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-013-1356-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider multicriteria allocation problems with linear sum objectives. Despite the fact that the single objective allocation problem is easily solvable, we show that already in the bicriteria case the problem becomes intractable, is NP-hard and has a non-connected efficient set in general. Using the equivalence to appropriately defined multiple criteria multiple-choice knapsack problems, an algorithm is suggested that uses partial dominance conditions to save computational time. Different types of enumeration schemes are discussed, for example, with respect to the number of necessary filtering operations and with regard to possible parallelizations of the procedure.
Keywords:
Multicriteria optimization
Combinatorial optimization
Location-allocation problem
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W