1-D-3 Upper and lower bounds for the budget-constrained multiple knapsack problem

スポンサーリンク

概要

• 論文の詳細を見る
• 社団法人日本オペレーションズ・リサーチ学会の論文
• 2009-09-09

著者

• You Byungjun

  The National Defense Academy

• Yamada Takeo

  The National Defense Academy

関連論文

• 1-D-3 Upper and lower bounds for the budget-constrained multiple knapsack problem
• 2-E-8 Shift-and-Merge Technique for the DP solution of the Time-constrained Backpacker Problem
• 2-F-1 Solution Strategies for Combinatorial Optimization Problems with a Knapsak-type Constraint
• 2-A-9 A branch-and-bound procedure for the precedence-constrained knapsack problem

スポンサーリンク