Content deleted Content added
→Complexity: −sp |
→Further reading: +* |
||
(One intermediate revision by the same user not shown) | |||
Line 22:
== Complexity ==
The generalized assignment problem is [[NP-hard]]
| last1 = Özbakir | first1 = Lale
| last2 = Baykasoğlu | first2 = Adil
Line 58:
==Further reading==
* {{cite book |isbn=978-3-540-24777-7|title=Knapsack Problems|last1=Kellerer|first1=Hans|last2=Pferschy|first2=Ulrich|last3=Pisinger|first3=David|date=2013-03-19|publisher=Springer }}
[[Category:NP-complete problems]]
|