default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshitsugu Yamamoto
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j28]Yoichi Izunaga
, Tomomi Matsui, Yoshitsugu Yamamoto:
A doubly nonnegative relaxation for modularity density maximization. Discret. Appl. Math. 275: 69-78 (2020)
2010 – 2019
- 2014
- [j27]Hajime Sasaki, Kaoru Kadoiwa, Hidetoshi Koyama, Yoshitaka Kamo, Yoshitsugu Yamamoto, Toshiyuki Oishi, Kazuo Hayashi:
Decrease in on-state gate current of AlGaN/GaN HEMTs by recombination-enhanced defect reaction of generated hot carriers investigated by TCAD simulation. Microelectron. Reliab. 54(12): 2662-2667 (2014) - [c2]Kotohumi Inaba, Yoichi Izunaga, Yoshitsugu Yamamoto:
A Lagrangian Relaxation Algorithm for Modularity Maximization Problem. OR 2014: 241-247 - [c1]Yoichi Izunaga, Keisuke Sato, Keiji Tatsumi, Yoshitsugu Yamamoto:
Row and Column Generation Algorithm for Maximization of Minimum Margin for Ranking Problems. OR 2014: 249-255 - 2013
- [j26]Noriyoshi Sukegawa, Yoshitsugu Yamamoto, Liyuan Zhang:
Lagrangian relaxation and pegging test for the clique partitioning problem. Adv. Data Anal. Classif. 7(4): 363-391 (2013) - [i1]Ayumi Igarashi, Yoshitsugu Yamamoto:
Computational complexity of the average covering tree value. CTW 2013: 223-226 - 2012
- [j25]Satoko Ryuo, Keisuke Sato, Yoshitsugu Yamamoto:
Parameterized fairness axioms on cycle-free graph games. J. Glob. Optim. 52(3): 487-497 (2012) - 2011
- [j24]Jun-ya Gotoh, Yoshitsugu Yamamoto, Weifeng Yao:
Bounding Contingent Claim Prices via Hedging Strategy with Coherent Risk Measures. J. Optim. Theory Appl. 151(3): 613-632 (2011) - 2010
- [j23]Yuichi Takano, Yoshitsugu Yamamoto:
Metric-Preserving Reduction of Earth Mover's Distance. Asia Pac. J. Oper. Res. 27(1): 39-54 (2010)
2000 – 2009
- 2008
- [j22]Yong-Chang Jiao, Chuangyin Dang, Yoshitsugu Yamamoto:
An extension of the decomposition method for solving nonlinear equations and its convergence. Comput. Math. Appl. 55(4): 760-775 (2008) - 2006
- [j21]Jun Wu, Wuyi Yue, Yoshitsugu Yamamoto, Shouyang Wang:
Risk analysis of a pay to delay capacity reservation contract. Optim. Methods Softw. 21(4): 635-651 (2006) - 2004
- [j20]A. J. J. Talman, Yoshitsugu Yamamoto:
Continuum of Zero Points of a Mapping on a Compact, Convex Set. SIAM J. Optim. 14(4): 1128-1139 (2004) - 2003
- [j19]M. Shigeno, I. Takahashi, Yoshitsugu Yamamoto:
Minimum Maximal Flow Problem: An Optimization over the Efficient Set. J. Glob. Optim. 25(4): 425-443 (2003) - [j18]Shouyang Wang, Yoshitsugu Yamamoto, Mei Yu:
A minimax rule for portfolio selection in frictional markets. Math. Methods Oper. Res. 57(1): 141-155 (2003) - [j17]Jun-ya Gotoh, Nguyen Van Thoai, Yoshitsugu Yamamoto:
Global optimization method for solving the minimum maximal flow problem. Optim. Methods Softw. 18(4): 395-415 (2003) - 2002
- [j16]Yoshitsugu Yamamoto:
Optimization over the efficient set: overview. J. Glob. Optim. 22(1-4): 285-317 (2002)
1990 – 1999
- 1999
- [j15]X. J. Liu, T. Umegaki, Yoshitsugu Yamamoto:
Heuristic Methods for Linear Multiplicative Programming. J. Glob. Optim. 15(4): 433-447 (1999) - 1998
- [j14]Takahito Kuno, Yoshitsugu Yamamoto:
A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs. J. Glob. Optim. 12(3): 247-265 (1998) - 1994
- [j13]Yang Dai, Yoshitsugu Yamamoto:
A continuous deformation algorithm for variational inequality problems on polytopes. Math. Program. 64: 103-122 (1994) - 1993
- [j12]Yoshitsugu Yamamoto, Zaifu Yang:
The (n + 1)2m-ray algorithm: a new simplicial algorithm for the variational inequality problem on ℝ+m×Sn. Ann. Oper. Res. 44(1): 93-113 (1993) - [j11]Kazuyuki Sekitani, Yoshitsugu Yamamoto:
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes. Math. Program. 61: 233-249 (1993) - 1992
- [j10]Yang Dai, Kazuyuki Sekitani, Yoshitsugu Yamamoto:
A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems. ZOR Methods Model. Oper. Res. 36(1): 23-53 (1992) - 1991
- [j9]Yang Dai, Gerard van der Laan, A. J. J. Talman, Yoshitsugu Yamamoto:
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron. SIAM J. Optim. 1(2): 151-165 (1991)
1980 – 1989
- 1989
- [j8]A. J. J. Talman, Yoshitsugu Yamamoto:
A Simplicial Algorithm for Stationary Point Problems on Polytopes. Math. Oper. Res. 14(3): 383-399 (1989) - 1985
- [j7]Hiroyoshi Tsuji, Riichi Takahashi, Hironao Kawashima, Yoshitsugu Yamamoto:
A Stochastic Approach for Estimating the Effectiveness of a Route Guidance System and Its Related Parameters. Transp. Sci. 19(4): 333-351 (1985) - 1984
- [j6]Yoshitsugu Yamamoto:
A unifying model based on retraction for fixed point algorithms. Math. Program. 28(2): 192-197 (1984) - [j5]Masakazu Kojima, Yoshitsugu Yamamoto:
A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm. Math. Program. 28(3): 288-328 (1984) - [j4]Yoshitsugu Yamamoto:
A variable dimension fixed point algorithm and the orientation of simplices. Math. Program. 30(3): 301-312 (1984) - 1983
- [j3]Yoshitsugu Yamamoto:
A new variable dimension algorithm for the fixed point problem. Math. Program. 25(3): 329-342 (1983) - 1982
- [j2]Masakazu Kojima, Yoshitsugu Yamamoto:
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods. Math. Program. 24(1): 177-215 (1982)
1970 – 1979
- 1978
- [j1]Yoshitsugu Yamamoto:
The Held - Karp algorithm and degree-constrained minimum 1-trees. Math. Program. 15(1): 228-231 (1978)
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-25 05:51 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:
