Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0377-2217(03)00420-X
Title: Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
Authors: Zhang, C.W.
Ong, H.L. 
Keywords: ε-Nondominated solution
Integer programming
Knapsack problem
LP-based heuristic
Multiple objective programming
Issue Date: 16-Dec-2004
Source: Zhang, C.W., Ong, H.L. (2004-12-16). Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic. European Journal of Operational Research 159 (3) : 545-557. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(03)00420-X
Abstract: In this paper, we propose a simple and useful method, the core of which is an efficient LP-based heuristic, for solving biobjective 0-1 knapsack problems. Extensive computational experiments show that the proposed method is able to generate a good approximation to the nondominated set very efficiently. We also suggest three qualitative criteria to evaluate such an approximation. In addition, the method can be extended to other problems having properties similar to the knapsack problem. © 2003 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/63326
ISSN: 03772217
DOI: 10.1016/S0377-2217(03)00420-X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

10
checked on Nov 18, 2017

Page view(s)

25
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


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