Please use this identifier to cite or link to this item:
|Title:||Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic||Authors:||Zhang, C.W.
Multiple objective programming
|Issue Date:||16-Dec-2004||Citation:||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.||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/87247||ISSN:||03772217|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 6, 2018
WEB OF SCIENCETM
checked on Dec 31, 2018
checked on Oct 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.