Now showing items 1-1 of 1

  • Dahl, Geir; Foldnes, Njål (Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2006)
    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. ...