Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic [An article from: European Journal of Operational Research] | ![Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: C.w. Zhang, H.l. Ong
Publisher: Elsevier
Category: Book
Buy New: $5.95
Sales Rank: 5059599
Format: Html
Media: Digital
Publication Date: December 16, 2004
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
|
|
|
