• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Øvrige samlinger
  • Høstingsarkiver
  • CRIStin høstingsarkiv
  • View Item
  •   Home
  • Øvrige samlinger
  • Høstingsarkiver
  • CRIStin høstingsarkiv
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

LP based heuristics for the multiple knapsack problem with assignment restrictions

Dahl, Geir; Foldnes, Njål
Journal article; AcceptedVersion; Peer reviewed
View/Open
multiple_knapsack.pdf (236.6Kb)
Year
2006
Permanent link
http://urn.nb.no/URN:NBN:no-37226

CRIStin
391494

Metadata
Show metadata
Appears in the following Collection
  • Matematisk institutt [2450]
  • CRIStin høstingsarkiv [15888]
  • Institutt for informatikk [3603]
Original version
Annals of Operations Research. 2006, 146 (1), 91-104, DOI: 10.1007/s10479-006-0048-1
Abstract
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.

The final publication is available at link.springer.com.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy