Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic [An article from: European Journal of Operational Research]

Great Price "Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic [An article from: European Journal of Operational Research]" for $5.95 Today

Price : $5.95
Offer Price : $5.95

Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic [An article from: European Journal of Operational Research] Overviews

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.

Affordable Price at Store Check Price Now!

*** Product Information and Prices Stored: May 02, 2010 08:53:36

Friends Link : All About GPS Watches Best Cocoa Programming Textbooks All About Cat And Dog Collars Best Deals And Reviews On Electric Pool Covers Cheap Price & Reviews On Multivariable Calculus Textbook