Seiji Kataoka

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 1

Top Topics

Multiple Knapsack

Top Venues

J. Inf. Process.

Eur. J. Oper. Res.

Publications

Seiji Kataoka
A Subtour Elimination Constraint for Non-simpl e Circuit Problems. J. Inf. Process. 32 (2024)
Seiji Kataoka, Takeo Yamada
Upper and lower bounding procedures for the multiple knapsack assignment problem. Eur. J. Oper. Res. 237 (2) (2014)
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe
Listing all the minimum spanning trees in an undirected graph. Int. J. Comput. Math. 87 (14) (2010)
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)
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)
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, Mayumi Futakawa, Seiji Kataoka
Some exact algorithms for the knapsack sharing problem. Eur. J. Oper. Res. 106 (1) (1998)
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, 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)