| 2009 |
|---|
| 9 | EE | Takeo Yamada,
Takahiro Takeoka:
An exact algorithm for the fixed-charge multiple knapsack problem.
European Journal of Operational Research 192(2): 700-705 (2009) |
| 2008 |
|---|
| 8 | EE | Fumiaki Taniguchi,
Takeo Yamada,
Seiji Kataoka:
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem.
Computers & OR 35(6): 2034-2048 (2008) |
| 2007 |
|---|
| 7 | EE | Byungjun You,
Takeo Yamada:
A pegging approach to the precedence-constrained knapsack problem.
European Journal of Operational Research 183(2): 618-632 (2007) |
| 2006 |
|---|
| 6 | EE | Masako Fujimoto,
Takeo Yamada:
An exact algorithm for the knapsack sharing problem with common items.
European Journal of Operational Research 171(2): 693-707 (2006) |
| 2005 |
|---|
| 5 | EE | Takeo Yamada,
Seiji Kataoka,
Kohtaro Watanabe:
Heuristic and exact algorithms for the spanning tree detection problem.
Computers & OR 32: 239-255 (2005) |
| 4 | EE | Takeo Yamada,
Kohtaro Watanabe,
Seiji Kataoka:
Algorithms to solve the knapsack constrained maximum spanning tree problem.
Int. J. Comput. Math. 82(1): 23-34 (2005) |
| 2002 |
|---|
| 3 | | Takeo Yamada,
Harunobu Kinoshita:
Finding all the negative cycles in a directed graph.
Discrete Applied Mathematics 118(3): 279-291 (2002) |
| 1997 |
|---|
| 2 | EE | Takeo Yamada,
Mayumi Futakawa:
Heuristic and reduction algorithms for the knapsack sharing problem.
Computers & OR 24(10): 961-967 (1997) |
| 1994 |
|---|
| 1 | EE | Takeo Yamada,
J. Yoruzuya,
Seiji Kataoka:
Enumerating extreme points of a highly degenerate polytope.
Computers & OR 21(4): 397-410 (1994) |
