Kataoka Seiji

Seiji Kataoka

Information about the author Seiji Kataoka will soon be added to the site.
Found 8 papers in total
Heuristic and exact algorithms for the spanning tree detection problem
Heuristic and exact algorithms for the spanning tree detection problem
2005
Given an integer α and an undirected graph with edges associated with integer...
Upper and lower bounding procedures for minimum rooted k-subtree problem
Upper and lower bounding procedures for minimum rooted k-subtree problem
2000
Given an undirected graph and a fixed root node on it, the minimum rooted k -subtree...
Some exact algorithms for the knapsack sharing problem
Some exact algorithms for the knapsack sharing problem
1998
The knapsack sharing problem (KSP) is formulated as an extension to the ordinary...
Minimum directed 1-subtree relaxation for score orienteering problem
Minimum directed 1-subtree relaxation for score orienteering problem
1998
Score orienteering is a variant of the orienteering game where competitors start at a...
A branch-and-bound algorithm for the mini-max spanning forest problem
A branch-and-bound algorithm for the mini-max spanning forest problem
1997
The mini-max spanning forest problem requires to find a spanning forest of an...
A heuristic algorithm for the mini-max spanning forest problem
A heuristic algorithm for the mini-max spanning forest problem
1996
In this paper we formulate the mini-max spanning forest problem for undirected graphs...
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
1991
It is commonly believed that the use of the assignment problem works well when one...
An algorithm for single constraint maximum collection problem
An algorithm for single constraint maximum collection problem
1988
There are many studies which consider an optimal tour on a given graph including the...
Papers per page: