Takeo Yamada - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2014

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

2012

Shift-and-merge technique for the DP solution of the time-constrained backpacker problemByungjun You, Takeo Yamada. cor, 39(3):664-670, 2012. [doi]

An Improved Reduction Method for the Robust Optimization of the Assignment ProblemByungjun You, Daisuke Yokoya, Takeo Yamada. apjor, 29(5), 2012. [doi]

2011

A reduction approach to the repeated assignment problemDaisuke Yokoya, Cees W. Duin, Takeo Yamada. eor, 210(2):185-193, 2011. [doi]

A mathematical programming approach to the construction of BIBDsDaisuke Yokoya, Takeo Yamada. ijcm, 88(5):1067-1082, 2011. [doi]

An exact algorithm for the budget-constrained multiple knapsack problemByungjun You, Takeo Yamada. ijcm, 88(16):3380-3393, 2011. [doi]

2010

Integrated CNTs thin film for MEMS mechanical sensorsVan Thanh Dau, Takeo Yamada, Dzung Viet Dao, Bui Thanh Tung, Kenji Hata, Susumu Sugiyama. mj, 41(12):860-864, 2010. [doi]

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]

An exact algorithm for the fixed-charge multiple knapsack problemTakeo Yamada, Takahiro Takeoka. eor, 192(2):700-705, 2009. [doi]

A mini-max spanning forest approach to the political districting problemTakeo Yamada. ijsysc, 40(5):471-477, 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]

2007

A pegging approach to the precedence-constrained knapsack problemByungjun You, Takeo Yamada. eor, 183(2):618-632, 2007. [doi]

2006

An exact algorithm for the knapsack sharing problem with common itemsMasako Fujimoto, Takeo Yamada. eor, 171(2):693-707, 2006. [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]

2002

Finding all the negative cycles in a directed graphTakeo Yamada, Harunobu Kinoshita. DAM, 118(3):279-291, 2002.

2000

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

Heuristic and exact algorithms for the simultaneous assignment problemTakeo Yamada, Yasushi Nasu. eor, 123(3):531-542, 2000. [doi]

1999

Sequential learning for associative memory using Kohonen feature mapTakeo Yamada, Motonobu Hattori, Masayuki Morisawa, Hiroshi Ito. ijcnn 1999: 1920-1923 [doi]

1998

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

1997

Heuristic and reduction algorithms for the knapsack sharing problemTakeo Yamada, Mayumi Futakawa. cor, 24(10):961-967, 1997. [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]

A network flow approach to a city emergency evacuation planningTakeo Yamada. ijsysc, 27(10):931-936, 1996. [doi]

1994

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

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

1990

A graph-theoretic approach to investigate structural and qualitative properties of systems: A surveyTakeo Yamada, Leslie R. Foulds. networks, 20(4):427-452, 1990. [doi]

1988

A network flow algorithm to find an elementary I/O matchingTakeo Yamada. networks, 18(2):105-109, 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL