| Article ID: | iaor20071458 |
| Country: | Netherlands |
| Volume: | 146 |
| Issue: | 1 |
| Start Page Number: | 91 |
| End Page Number: | 104 |
| Publication Date: | Sep 2006 |
| Journal: | Annals of Operations Research |
| Authors: | Dahl Geir, Foldnes Njl |
| Keywords: | programming: linear, heuristics |
Starting with a problem in wireless telecommunication, we are led to study the multiple knapsack problem with assignment restrictions. This problem is NP-hard. We consider special cases and their computational complexity. We present both randomized and deterministic LP based algorithms, and show both theoretically and computationally their usefulness for large-scale problems.