Seiji Kataoka - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2024

A Subtour Elimination Constraint for Non-simpl e Circuit ProblemsSeiji Kataoka. jip, 32:346-351, 2024. [doi]

2014

Upper and lower bounding procedures for the multiple knapsack assignment problemSeiji Kataoka, Takeo Yamada. eor, 237(2):440-447, 2014. [doi]

2010

Listing all the minimum spanning trees in an undirected graphTakeo Yamada, Seiji Kataoka, Kohtaro Watanabe. ijcm, 87(14):3175-3185, 2010. [doi]

2009

A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problemFumiaki Taniguchi, Takeo Yamada, Seiji Kataoka. ijcm, 86(5):779-793, 2009. [doi]

2008

Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problemFumiaki Taniguchi, Takeo Yamada, Seiji Kataoka. cor, 35(6):2034-2048, 2008. [doi]

2005

Algorithms to solve the knapsack constrained maximum spanning tree problemTakeo Yamada, Kohtaro Watanabe, Seiji Kataoka. ijcm, 82(1):23-34, 2005. [doi]

Heuristic and exact algorithms for the spanning tree detection problemTakeo Yamada, Seiji Kataoka, Kohtaro Watanabe. cor, 32:239-255, 2005. [doi]

2000

Upper and lower bounding procedures for minimum rooted k-subtree problemSeiji Kataoka, Norio Araki, Takeo Yamada. eor, 122(3):561-569, 2000. [doi]

1998

Some exact algorithms for the knapsack sharing problemTakeo Yamada, Mayumi Futakawa, Seiji Kataoka. eor, 106(1):177-183, 1998. [doi]

1996

A resource allocation problem on timed marked graphs: a decomposition approachHiroshi Shimohata, Seiji Kataoka, Takeo Yamada. ijsysc, 27(4):405-411, 1996. [doi]

1994

On some LP problems for performance evaluation of timed marked graphsTakeo Yamada, Seiji Kataoka. tac, 39(3):696-698, 1994. [doi]

Enumerating extreme points of a highly degenerate polytopeTakeo Yamada, J. Yoruzuya, Seiji Kataoka. cor, 21(4):397-410, 1994. [doi]

Sign in or sign up to see more results.

runs on WebDSL