Research keywords (2):
knapsack problems
, combinatorial optimization
Research theme for competitive and other funds (1):
Knapsack Problems
Papers (7):
Iida, Hiroshi. Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem. SOP Transactions on Appl Math. 2014. 1. 3. 39-41
Hiroshi Iida. An addendum to "Some thoughts on the 2-approximation algorithm for knapsack problems: a survey". Far East J Appl Math. 2014. 88. 3. 239-245
Hiroshi Iida. Some thoughts on the 2-approximation algorithm for knapsack problems: a survey. Far East J Appl Math. 2014. 87. 3. 257-267
IIDA Hiroshi. Two topics in dominance relations for the unbounded knapsack problem. Open Appl Math J. 2008. 2. 1. 16-19