Takeo Yamada

28 papers B 1Journal 27
YearRankTypeTitle / Venue / Authors
2014 J jnl
Upper and lower bounding procedures for the multiple knapsack assignment problem.
Eur. J. Oper. Res.
Seiji Kataoka, Takeo Yamada
2012 J jnl
An Improved Reduction Method for the Robust Optimization of the Assignment Problem.
Asia Pac. J. Oper. Res.
Byungjun You, Daisuke Yokoya, Takeo Yamada
2012 J jnl
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem.
Comput. Oper. Res.
Byungjun You, Takeo Yamada
2011 J jnl
A mathematical programming approach to the construction of BIBDs.
Int. J. Comput. Math.
Daisuke Yokoya, Takeo Yamada
2011 J jnl
A reduction approach to the repeated assignment problem.
Eur. J. Oper. Res.
Daisuke Yokoya, Cees W. Duin, Takeo Yamada
2011 J jnl
An exact algorithm for the budget-constrained multiple knapsack problem.
Int. J. Comput. Math.
Byungjun You, Takeo Yamada
2010 J jnl
Integrated CNTs thin film for MEMS mechanical sensors.
Microelectron. J.
Van Thanh Dau, Takeo Yamada, Dzung Viet Dao, Bui Thanh Tung, Kenji Hata, Susumu Sugiyama
2010 J jnl
Listing all the minimum spanning trees in an undirected graph.
Int. J. Comput. Math.
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe
2009 J jnl
A mini-max spanning forest approach to the political districting problem.
Int. J. Syst. Sci.
Takeo Yamada
2009 J jnl
A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem.
Int. J. Comput. Math.
Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka
2009 J jnl
An exact algorithm for the fixed-charge multiple knapsack problem.
Eur. J. Oper. Res.
Takeo Yamada, Takahiro Takeoka
2008 J jnl
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem.
Comput. Oper. Res.
Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka
2007 J jnl
A pegging approach to the precedence-constrained knapsack problem.
Eur. J. Oper. Res.
Byungjun You, Takeo Yamada
2006 J jnl
An exact algorithm for the knapsack sharing problem with common items.
Eur. J. Oper. Res.
Masako Fujimoto, Takeo Yamada
2005 J jnl
Algorithms to solve the knapsack constrained maximum spanning tree problem.
Int. J. Comput. Math.
Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka
2005 J jnl
Heuristic and exact algorithms for the spanning tree detection problem.
Comput. Oper. Res.
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe
2002 J jnl
Finding all the negative cycles in a directed graph.
Discret. Appl. Math.
Takeo Yamada, Harunobu Kinoshita
2000 J jnl
Heuristic and exact algorithms for the simultaneous assignment problem.
Eur. J. Oper. Res.
Takeo Yamada, Yasushi Nasu
2000 J jnl
Upper and lower bounding procedures for minimum rooted k-subtree problem.
Eur. J. Oper. Res.
Seiji Kataoka, Norio Araki, Takeo Yamada
1999 B conf
Sequential learning for associative memory using Kohonen feature map.
IJCNN
Takeo Yamada, Motonobu Hattori, Masayuki Morisawa, Hiroshi Ito
1998 J jnl
Some exact algorithms for the knapsack sharing problem.
Eur. J. Oper. Res.
Takeo Yamada, Mayumi Futakawa, Seiji Kataoka
1997 J jnl
Heuristic and reduction algorithms for the knapsack sharing problem.
Comput. Oper. Res.
Takeo Yamada, Mayumi Futakawa
1996 J jnl
A network flow approach to a city emergency evacuation planning.
Int. J. Syst. Sci.
Takeo Yamada
1996 J jnl
A resource allocation problem on timed marked graphs: a decomposition approach.
Int. J. Syst. Sci.
Hiroshi Shimohata, Seiji Kataoka, Takeo Yamada
1994 J jnl
Enumerating extreme points of a highly degenerate polytope.
Comput. Oper. Res.
Takeo Yamada, J. Yoruzuya, Seiji Kataoka
1994 J jnl
On some LP problems for performance evaluation of timed marked graphs.
IEEE Trans. Autom. Control.
Takeo Yamada, Seiji Kataoka
1990 J jnl
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey.
Networks
Takeo Yamada, Leslie R. Foulds
1988 J jnl
A network flow algorithm to find an elementary I/O matching.
Networks
Takeo Yamada