.png){kind=icon}
.png){kind=icon}
Return
Exact algorithm for bi-objective 0-1 knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.04.062.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new procedure based on linear mathematical programming formulation to find all efficient solutions of bi-objective 0-1 knapsack problem. We solve a limited number of single objective problems to find efficient solutions of bi-objective 0-1 knapsack problem. We show that the proposed method is able to generate efficient solutions with less constraints and variables than the general linear program found in the literature. An example is presented to illustrate the steps of the procedure. (C) 2007 Elsevier Inc. All rights reserved.
Keywords:
bi-objective 0-1 knapsack problem
multiple objective mathematical programming
linear programming
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W