Takeo Yamada

Publication Activity (10 Years)

Years Active: 1988-2014
Publications (10 Years): 0

Top Topics

Chance Constraints

Multiple Knapsack

Robust Optimization

Top Venues

Asia Pac. J. Oper. Res.

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

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