Takeo Yamada

According to our database, Takeo Yamada authored at least 28 papers between 1988 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

Upper and lower bounding procedures for the multiple knapsack assignment problem.

Seiji Kataoka, Takeo Yamada

Eur. J. Oper. Res., 2014

2012

Shift-and-merge technique for the DP solution of the time-constrained backpacker problem.

Byungjun You, Takeo Yamada

Comput. Oper. Res., 2012

An Improved Reduction Method for the Robust Optimization of the Assignment Problem.

Byungjun You, Daisuke Yokoya, Takeo Yamada

Asia Pac. J. Oper. Res., 2012

2011

An exact algorithm for the budget-constrained multiple knapsack problem.

Byungjun You, Takeo Yamada

Int. J. Comput. Math., 2011

A mathematical programming approach to the construction of BIBDs.

Daisuke Yokoya, Takeo Yamada

Int. J. Comput. Math., 2011

A reduction approach to the repeated assignment problem.

Daisuke Yokoya, Cees W. Duin, Takeo Yamada

Eur. J. Oper. Res., 2011

2010

Integrated CNTs thin film for MEMS mechanical sensors.

Van Thanh Dau, Takeo Yamada, Dzung Viet Dao, Bui Thanh Tung, Kenji Hata, Susumu Sugiyama

Microelectron. J., 2010

Listing all the minimum spanning trees in an undirected graph.

Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe

Int. J. Comput. Math., 2010

2009

A mini-max spanning forest approach to the political districting problem.

Takeo Yamada

Int. J. Syst. Sci., 2009

A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem.

Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka

Int. J. Comput. Math., 2009

An exact algorithm for the fixed-charge multiple knapsack problem.

Takeo Yamada, Takahiro Takeoka

Eur. J. Oper. Res., 2009

2008

Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem.

Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka

Comput. Oper. Res., 2008

2007

A pegging approach to the precedence-constrained knapsack problem.

Byungjun You, Takeo Yamada

Eur. J. Oper. Res., 2007

2006

An exact algorithm for the knapsack sharing problem with common items.

Masako Fujimoto, Takeo Yamada

Eur. J. Oper. Res., 2006

2005

Algorithms to solve the knapsack constrained maximum spanning tree problem.

Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka

Int. J. Comput. Math., 2005

Heuristic and exact algorithms for the spanning tree detection problem.

Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe

Comput. Oper. Res., 2005

2002

Finding all the negative cycles in a directed graph.

Takeo Yamada, Harunobu Kinoshita

Discret. Appl. Math., 2002

2000

Heuristic and exact algorithms for the simultaneous assignment problem.

Takeo Yamada, Yasushi Nasu

Eur. J. Oper. Res., 2000

Upper and lower bounding procedures for minimum rooted k-subtree problem.

Seiji Kataoka, Norio Araki, Takeo Yamada

Eur. J. Oper. Res., 2000

1999

Sequential learning for associative memory using Kohonen feature map.

Takeo Yamada, Motonobu Hattori, Masayuki Morisawa, Hiroshi Ito

Proceedings of the International Joint Conference Neural Networks, 1999

1998

Some exact algorithms for the knapsack sharing problem.

Takeo Yamada, Mayumi Futakawa, Seiji Kataoka

Eur. J. Oper. Res., 1998

1997

Heuristic and reduction algorithms for the knapsack sharing problem.

Takeo Yamada, Mayumi Futakawa

Comput. Oper. Res., 1997

1996

A network flow approach to a city emergency evacuation planning.

Takeo Yamada

Int. J. Syst. Sci., 1996

A resource allocation problem on timed marked graphs: a decomposition approach.

Hiroshi Shimohata, Seiji Kataoka, Takeo Yamada

Int. J. Syst. Sci., 1996

1994

On some LP problems for performance evaluation of timed marked graphs.

Takeo Yamada, Seiji Kataoka

IEEE Trans. Autom. Control., 1994

Enumerating extreme points of a highly degenerate polytope.

Takeo Yamada, J. Yoruzuya, Seiji Kataoka

Comput. Oper. Res., 1994

1990

A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey.

Takeo Yamada, Leslie R. Foulds

Networks, 1990

1988

A network flow algorithm to find an elementary I/O matching.

Takeo Yamada

Networks, 1988