On solving the max-min 0-1 knapsack problem

スポンサーリンク

概要

• 論文の詳細を見る

• The max-min 0-1 knapsack problem was recently introduced by Gang Yu in the journal of Operations Research. The problem is an extension of the classical 0-1 knapsack problem. This report includes several suggestions on the paper in which upper and lower bounds for the max-min 0-1 knapsack problem have been proposed. In this report we also propose new upper and lower bounds and a new algorithm which exploits our proposed bounds. Computation experiments are also included.

• 北陸先端科学技術大学院大学の論文
• 1997-06-02

著者

• Iida Hiroshi

  School Of Information Science Jaist Hokuriku

関連論文

• On solving the max-min 0-1 knapsack problem

スポンサーリンク