Enumerating extreme points of a highly degenerate polytope. - Takeo Yamada; J. Yoruzuya; Seiji Kataoka (Comput. Oper. Res., 1994)

On some LP problems for performance evaluation of timed marked graphs. - Takeo Yamada; Seiji Kataoka (IEEE Trans. Autom. Control., 1994)

A resource allocation problem on timed marked graphs: a decomposition approach. - Hiroshi Shimohata; Seiji Kataoka; Takeo Yamada (Int. J. Syst. Sci., 1996)

Some exact algorithms for the knapsack sharing problem. - Takeo Yamada; Mayumi Futakawa; Seiji Kataoka (Eur. J. Oper. Res., 1998)

Upper and lower bounding procedures for minimum rooted k-subtree problem. - Seiji Kataoka; Norio Araki; Takeo Yamada (Eur. J. Oper. Res., 2000)

Heuristic and exact algorithms for the spanning tree detection problem. - Takeo Yamada; Seiji Kataoka; Kohtaro Watanabe 001 (Comput. Oper. Res., 2005)

Algorithms to solve the knapsack constrained maximum spanning tree problem. - Takeo Yamada; Kohtaro Watanabe 001; Seiji Kataoka (Int. J. Comput. Math., 2005)

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)

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)

Listing all the minimum spanning trees in an undirected graph. - Takeo Yamada; Seiji Kataoka; Kohtaro Watanabe 001 (Int. J. Comput. Math., 2010)

Upper and lower bounding procedures for the multiple knapsack assignment problem. - Seiji Kataoka; Takeo Yamada (Eur. J. Oper. Res., 2014)

A Subtour Elimination Constraint for Non-simpl e Circuit Problems. - Seiji Kataoka (J. Inf. Process., 2024)