科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
专利缴费
专利查询
未登录
返回
T
Takeo Yamada
national defense academy - japan
17
H指数
81
论文数
1.1K
被引数
0
相关解读
订阅
收录论文
16
发表时间
发表时间
IF
被引数
Upper and lower bounding procedures for the multiple knapsack assignment problem
多背包分配问题的上下界程序
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2014-09-01
24
PRE
AI
Kataoka, Seiji; Yamada, Takeo
分享
收藏
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2012-03-01
0
PRE
AI
You, Byungjun; Yamada, Takeo
分享
收藏
A reduction approach to the repeated assignment problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2011-04-01
1
PRE
AI
Yokoya, Daisuke; Duin, Cees W.; Yamada, Takeo
分享
收藏
An exact algorithm for the fixed-charge multiple knapsack problem
固定电荷多背包问题的精确算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2009-01-01
18
PRE
AI
Yamada, Takeo; Takeoka, Takahiro
分享
收藏
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
多场景背包问题最大-最小优化的启发式精确算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2008-06-01
23
PRE
AI
Taniguchi, Fumiaki; Yamada, Takeo; Kataoka, Seiji
分享
收藏
A pegging approach to the precedence-constrained knapsack problem
优先约束背包问题的钉住方法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2007-12-01
17
OA
AI
You, Byungjun; Yamada, Takeo
分享
收藏
An exact algorithm for the knapsack sharing problem with common items
具有公共物品的背包共享问题的精确算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2006-06-01
18
OA
AI
Fujimoto, M; Yamada, T
分享
收藏
Heuristic and exact algorithms for the spanning tree detection problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2005-02-01
0
PRE
AI
Yamada, T; Kataoka, S; Watanabe, K
分享
收藏
Heuristic and exact algorithms for the simultaneous assignment problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2000-06-01
7
PRE
AI
Yamada, T; Nasu, Y
分享
收藏
Upper and lower bounding procedures for minimum rooted k-subtree problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2000-05-01
4
PRE
AI
Kataoka, S; Araki, N; Yamada, T
分享
收藏
Some exact algorithms for the knapsack sharing problem
背包共享问题的一些精确算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1998-04-01
24
PRE
AI
Yamada, T; Futakawa, M; Kataoka, S
分享
收藏
Minimum directed 1-subtree relaxation for score orienteering problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1998-01-01
10
PRE
AI
Kataoka, S; Yamada, T; Morito, S
分享
收藏
Heuristic and reduction algorithms for the knapsack sharing problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
1997-10-01
13
PRE
AI
Yamada, T; Futakawa, M
分享
收藏
A branch-and-bound algorithm for the mini-max spanning forest problem
Mini-max生成森林问题的分支定界算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1997-08-01
9
PRE
AI
Yamada, T; Takahashi, H; Kataoka, S
分享
收藏
A heuristic algorithm for the mini-max spanning forest problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1996-06-01
17
PRE
AI
Yamada, T; Takahashi, H; Kataoka, S
分享
收藏
ALGORITHMS TO VERIFY GENERIC CAUSALITY AND CONTROLLABILITY OF DESCRIPTOR SYSTEMS
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
IF
7
1985-09-01
12
PRE
AI
YAMADA, T; LUENBERGER, DG
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
D
David G. Luenberger
H 指数: 40 · 论文数: 166
N
Norio Araki
H 指数: 24 · 论文数: 74
C
C.W. Duin
H 指数: 15 · 论文数: 41
K
Kohtaro Watanabe
H 指数: 14 · 论文数: 93
S
Susumu Morito
H 指数: 10 · 论文数: 67
查看更多