A Short Note on the Reducibility of the Collapsing Knapsack Problem
Year of publication: |
2002
|
---|---|
Authors: | Iida, Hiroshi ; Uno, Takeaki |
Published in: |
Journal of the Operations Research Society of Japan : JORSJ. - Tokyo : Soc., ISSN 0453-4514, ZDB-ID 715544x. - Vol. 45.2002, 3, p. 293-298
|
Saved in:
Saved in favorites
Similar items by person
-
A Tree Partitioning Problem Arising from an Evacuation Problem in Tree Dynamic Networks
Mamada, Satoko, (2005)
-
An O(n2log2n) Algorithm for Input-or-Output Test in Disjunctive Scheduling
Miyamoto, Yuichiro, (2004)
-
Okamoto, Yoshio, (2011)
- More ...