Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13626
Title: Multiple knapsack problem with inter-related items and its applications to real world problems
Authors: ANG JUAY CHIN
Keywords: Multiple knapsack problem, Venue assignment problem
Issue Date: 20-Jan-2004
Source: ANG JUAY CHIN (2004-01-20). Multiple knapsack problem with inter-related items and its applications to real world problems. ScholarBank@NUS Repository.
Abstract: Motivated by a real world application, we study a variant of the classic knapsack problem, which we call the Multiple Knapsack Problem with Inter-related Items (MKPIR). We are given a set of items and a set of knapsacks of limited capacity. For each item, a set of knapsacks that can hold that item is specified. In addition, binary relationships may exist between the items. These relationships affect the profit of having that item in the knapsack in consideration. In this thesis, we adopted a few heuristics and test them on the venue assignment problem, instance of MKPIR, using actual data and randomly generated test instances.
URI: http://scholarbank.nus.edu.sg/handle/10635/13626
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ANGJC.pdf2.48 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

248
checked on Jan 15, 2018

Download(s)

164
checked on Jan 15, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.