An integer linear programming model for binary knapsack problem with dependent item values

Mougouei, Davoud ORCID: https://orcid.org/0000-0002-4271-9174 and Powers, David M.W. and Moeini, Ashgar (2017) An integer linear programming model for binary knapsack problem with dependent item values. In: 30th Australasian Joint Conference on Artificial Intelligence (AI 2017), 19 Aug - 20 Aug 2017, Melbourne, Australia.


Abstract

Binary Knapsack Problem (BKP) is to select a subset of items with the highest value while keeping the size within the capacity of the knapsack. This paper presents an Integer Linear Programming (ILP) model for a variation of BKP where the value of an item may depend on presence or absence of other items in the knapsack. Strengths of such Value-Related Dependencies are assumed to be imprecise and hard to specify. To capture this imprecision, we have proposed modeling value-related dependencies using fuzzy graphs and their algebraic structure. We have demonstrated through simulations that our proposed ILP model is scalable to large number of items.


Statistics for USQ ePrint 46114
Statistics for this ePrint Item
Item Type: Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Refereed: Yes
Item Status: Live Archive
Faculty/School / Institute/Centre: No Faculty
Faculty/School / Institute/Centre: No Faculty
Date Deposited: 27 Mar 2022 23:27
Last Modified: 30 May 2022 00:51
Uncontrolled Keywords: binary knapsack problem; integer linear programming; dependency; value; fuzzy graph
Fields of Research (2020): 46 INFORMATION AND COMPUTING SCIENCES > 4612 Software engineering > 461299 Software engineering not elsewhere classified
Identification Number or DOI: https://doi.org/10.1007/978-3-319-63004-5_12
URI: http://eprints.usq.edu.au/id/eprint/46114

Actions (login required)

View Item Archive Repository Staff Only