Seiji Kataoka

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2024 J jnl
A Subtour Elimination Constraint for Non-simpl e Circuit Problems.
J. Inf. Process.
Seiji Kataoka
2014 J jnl
Upper and lower bounding procedures for the multiple knapsack assignment problem.
Eur. J. Oper. Res.
Seiji Kataoka, Takeo Yamada
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 virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem.
Int. J. Comput. Math.
Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka
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
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
2000 J jnl
Upper and lower bounding procedures for minimum rooted k-subtree problem.
Eur. J. Oper. Res.
Seiji Kataoka, Norio Araki, Takeo Yamada
1998 J jnl
Some exact algorithms for the knapsack sharing problem.
Eur. J. Oper. Res.
Takeo Yamada, Mayumi Futakawa, Seiji Kataoka
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