Work

An Integer Programming Model for Binary Knapsack Problem with Value-Related Dependencies among Elements

Year: 2017

Type: preprint

Abstract: Binary Knapsack Problem (BKP) is to select a subset of an element (item) set with the highest value while keeping the total weight within the capacity of the knapsack. This paper presents an integer programming model for a variation of BKP where the value of each element may depend on selecting or ignoring other elements. 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1702.06662

Authors: Mougouei, Davoud, Powers, David M. W., Moeini, Asghar

Institution: Flinders University

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2594508846

Cites: 1

Cited by: 2

Related to: 10