Yamada Takeo

Takeo Yamada

Information about the author Takeo Yamada will soon be added to the site.
Found 11 papers in total
Shift‐and‐merge technique for the DP solution of the time‐constrained backpacker problem
Shift‐and‐merge technique for the DP solution of the time‐constrained backpacker problem
2012
We formulate the time‐constrained backpacker problem as an extension of the...
A mini-max spanning forest approach to the political districting problem
A mini-max spanning forest approach to the political districting problem
2009
We formulate the problem of political districting as a mini-max spanning forest...
An exact algorithm for the knapsack sharing problem with common items
An exact algorithm for the knapsack sharing problem with common items
2006
We are concerned with a variation of the knapsack problem as well as of the knapsack...
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...
Heuristic and exact algorithms for the simultaneous assignment problem
Heuristic and exact algorithms for the simultaneous assignment problem
2000
The simultaneous assignment problem is formulated as an extension to the assignment...
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...
Heuristic and reduction algorithms for the knapsack sharing problem
Heuristic and reduction algorithms for the knapsack sharing problem
1997
The knapsack sharing problem (KSP) is newly formulated as an extension of the knapsack...
Papers per page: