default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakeo Yamada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j27]Seiji Kataoka, Takeo Yamada:
Upper and lower bounding procedures for the multiple knapsack assignment problem. Eur. J. Oper. Res. 237(2): 440-447 (2014)- 2012
- [j26]Byungjun You, Daisuke Yokoya, Takeo Yamada:
An Improved Reduction Method for the Robust Optimization of the Assignment Problem. Asia Pac. J. Oper. Res. 29(5) (2012) - [j25]Byungjun You, Takeo Yamada:
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem. Comput. Oper. Res. 39(3): 664-670 (2012) - 2011
- [j24]Daisuke Yokoya, Cees W. Duin, Takeo Yamada:
A reduction approach to the repeated assignment problem. Eur. J. Oper. Res. 210(2): 185-193 (2011) - [j23]Daisuke Yokoya, Takeo Yamada:
A mathematical programming approach to the construction of BIBDs. Int. J. Comput. Math. 88(5): 1067-1082 (2011) - [j22]Byungjun You, Takeo Yamada:
An exact algorithm for the budget-constrained multiple knapsack problem. Int. J. Comput. Math. 88(16): 3380-3393 (2011) - 2010
- [j21]Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe:
Listing all the minimum spanning trees in an undirected graph. Int. J. Comput. Math. 87(14): 3175-3185 (2010) - [j20]Van Thanh Dau
, Takeo Yamada, Dzung Viet Dao, Bui Thanh Tung, Kenji Hata, Susumu Sugiyama:
Integrated CNTs thin film for MEMS mechanical sensors. Microelectron. J. 41(12): 860-864 (2010)
2000 – 2009
- 2009
- [j19]Takeo Yamada, Takahiro Takeoka:
An exact algorithm for the fixed-charge multiple knapsack problem. Eur. J. Oper. Res. 192(2): 700-705 (2009) - [j18]Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka:
A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem. Int. J. Comput. Math. 86(5): 779-793 (2009) - [j17]Takeo Yamada:
A mini-max spanning forest approach to the political districting problem. Int. J. Syst. Sci. 40(5): 471-477 (2009) - 2008
- [j16]Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka:
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem. Comput. Oper. Res. 35(6): 2034-2048 (2008) - 2007
- [j15]Byungjun You, Takeo Yamada:
A pegging approach to the precedence-constrained knapsack problem. Eur. J. Oper. Res. 183(2): 618-632 (2007) - 2006
- [j14]Masako Fujimoto, Takeo Yamada:
An exact algorithm for the knapsack sharing problem with common items. Eur. J. Oper. Res. 171(2): 693-707 (2006) - 2005
- [j13]Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe:
Heuristic and exact algorithms for the spanning tree detection problem. Comput. Oper. Res. 32: 239-255 (2005) - [j12]Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka:
Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82(1): 23-34 (2005) - 2002
- [j11]Takeo Yamada, Harunobu Kinoshita:
Finding all the negative cycles in a directed graph. Discret. Appl. Math. 118(3): 279-291 (2002) - 2000
- [j10]Seiji Kataoka, Norio Araki, Takeo Yamada:
Upper and lower bounding procedures for minimum rooted k-subtree problem. Eur. J. Oper. Res. 122(3): 561-569 (2000) - [j9]Takeo Yamada, Yasushi Nasu:
Heuristic and exact algorithms for the simultaneous assignment problem. Eur. J. Oper. Res. 123(3): 531-542 (2000)
1990 – 1999
- 1999
- [c1]Takeo Yamada, Motonobu Hattori, Masayuki Morisawa, Hiroshi Ito:
Sequential learning for associative memory using Kohonen feature map. IJCNN 1999: 1920-1923 - 1998
- [j8]Takeo Yamada, Mayumi Futakawa, Seiji Kataoka:
Some exact algorithms for the knapsack sharing problem. Eur. J. Oper. Res. 106(1): 177-183 (1998) - 1997
- [j7]Takeo Yamada, Mayumi Futakawa:
Heuristic and reduction algorithms for the knapsack sharing problem. Comput. Oper. Res. 24(10): 961-967 (1997) - 1996
- [j6]Hiroshi Shimohata, Seiji Kataoka, Takeo Yamada:
A resource allocation problem on timed marked graphs: a decomposition approach. Int. J. Syst. Sci. 27(4): 405-411 (1996) - [j5]Takeo Yamada:
A network flow approach to a city emergency evacuation planning. Int. J. Syst. Sci. 27(10): 931-936 (1996) - 1994
- [j4]Takeo Yamada, J. Yoruzuya, Seiji Kataoka:
Enumerating extreme points of a highly degenerate polytope. Comput. Oper. Res. 21(4): 397-410 (1994) - [j3]Takeo Yamada, Seiji Kataoka:
On some LP problems for performance evaluation of timed marked graphs. IEEE Trans. Autom. Control. 39(3): 696-698 (1994) - 1990
- [j2]Takeo Yamada, Leslie R. Foulds:
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey. Networks 20(4): 427-452 (1990)
1980 – 1989
- 1988
- [j1]Takeo Yamada:
A network flow algorithm to find an elementary I/O matching. Networks 18(2): 105-109 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
