logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Back
T

Takeo Yamada

national defense academy - japan

17H-index
81Paper Count
1.1KCitation Count
Published Papers 16
Publication Date
logo
Upper and lower bounding procedures for the multiple knapsack assignment problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2014-09-01
err24
PREAI
errKataoka, Seiji; Yamada, Takeo
errShare
errSave
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2012-03-01
err0
PREAI
errYou, Byungjun; Yamada, Takeo
errShare
errSave
A reduction approach to the repeated assignment problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2011-04-01
err1
PREAI
errYokoya, Daisuke; Duin, Cees W.; Yamada, Takeo
errShare
errSave
An exact algorithm for the fixed-charge multiple knapsack problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2009-01-01
err18
PREAI
errYamada, Takeo; Takeoka, Takahiro
errShare
errSave
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2008-06-01
err23
PREAI
errTaniguchi, Fumiaki; Yamada, Takeo; Kataoka, Seiji
errShare
errSave
A pegging approach to the precedence-constrained knapsack problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2007-12-01
err17
errOAAI
errYou, Byungjun; Yamada, Takeo
errShare
errSave
An exact algorithm for the knapsack sharing problem with common items
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2006-06-01
err18
errOAAI
errFujimoto, M; Yamada, T
errShare
errSave
Heuristic and exact algorithms for the spanning tree detection problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2005-02-01
err0
PREAI
errYamada, T; Kataoka, S; Watanabe, K
errShare
errSave
Heuristic and exact algorithms for the simultaneous assignment problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2000-06-01
err7
PREAI
errYamada, T; Nasu, Y
errShare
errSave
Upper and lower bounding procedures for minimum rooted k-subtree problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2000-05-01
err4
PREAI
errKataoka, S; Araki, N; Yamada, T
errShare
errSave
Some exact algorithms for the knapsack sharing problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err1998-04-01
err24
PREAI
errYamada, T; Futakawa, M; Kataoka, S
errShare
errSave
Minimum directed 1-subtree relaxation for score orienteering problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err1998-01-01
err10
PREAI
errKataoka, S; Yamada, T; Morito, S
errShare
errSave
Heuristic and reduction algorithms for the knapsack sharing problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err1997-10-01
err13
PREAI
errYamada, T; Futakawa, M
errShare
errSave
A branch-and-bound algorithm for the mini-max spanning forest problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err1997-08-01
err9
PREAI
errYamada, T; Takahashi, H; Kataoka, S
errShare
errSave
A heuristic algorithm for the mini-max spanning forest problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err1996-06-01
err17
PREAI
errYamada, T; Takahashi, H; Kataoka, S
errShare
errSave
ALGORITHMS TO VERIFY GENERIC CAUSALITY AND CONTROLLABILITY OF DESCRIPTOR SYSTEMS
errIEEE TRANSACTIONS ON AUTOMATIC CONTROL
IF7
err1985-09-01
err12
PREAI
errYAMADA, T; LUENBERGER, DG
errShare
errSave

Research Directions

The data has not been retrieved yet.
Co-authors
Cooperation Journals
D
David G. Luenberger
H-index: 40 · Papers: 166
N
Norio Araki
H-index: 24 · Papers: 74
C
C.W. Duin
H-index: 15 · Papers: 41
K
Kohtaro Watanabe
H-index: 14 · Papers: 93
S
Susumu Morito
H-index: 10 · Papers: 67
View more