default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakahito Kuno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Takahito Kuno
:
A revision of the rectangular algorithm for a class of DC optimization problems. J. Glob. Optim. 83(2): 187-200 (2022)- 2020
- [j28]Marco Antônio Florenzano Mollinetti, Bernardo Bentes Gatto, Mario Tasso Ribeiro Serra Neto, Takahito Kuno:
A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal Problems. Entropy 22(9): 1004 (2020)
2010 – 2019
- 2018
- [j27]Takahito Kuno:
A modified simplicial algorithm for convex maximization based on an extension of ω-subdivision. J. Glob. Optim. 71(2): 297-311 (2018) - [j26]Takahito Kuno, Yoshio Sano, Takahiro Tsuruda:
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm. Optim. Lett. 12(5): 933-943 (2018) - [c2]Marco Antônio Florenzano Mollinetti, Mario Tasso Ribeiro Serra Neto, Takahito Kuno:
Deterministic Parameter Selection of Artificial Bee Colony Based on Diagonalization. HIS 2018: 85-95 - 2016
- [j25]Takahito Kuno, Tomohiro Ishihama:
A generalization of \(\omega \) -subdivision ensuring convergence of the simplicial algorithm. Comput. Optim. Appl. 64(2): 535-555 (2016) - 2015
- [j24]Takahito Kuno, Tomohiro Ishihama:
A convergent conical algorithm with $$\omega $$ ω -bisection for concave minimization. J. Glob. Optim. 61(2): 203-220 (2015) - 2013
- [j23]Takahito Kuno, Toshiyuki Masaki:
A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Comput. Optim. Appl. 54(1): 93-109 (2013) - 2012
- [j22]Takahito Kuno, Paul E. K. Buckland:
A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies. J. Glob. Optim. 52(3): 371-390 (2012)
2000 – 2009
- 2009
- [c1]Pham Ngoc Anh, Takahito Kuno:
A Cutting Hyperplane Method for Generalized Monotone Nonlipschitzian Multivalued Variational Inequalities. HPSC 2009: 1-11 - [r2]Takahito Kuno:
Global Optimization in Multiplicative Programming. Encyclopedia of Optimization 2009: 1366-1370 - [r1]Takahito Kuno:
Multiplicative Programming. Encyclopedia of Optimization 2009: 2511-2513 - 2008
- [j21]Takahito Kuno, Hidetoshi Nagai:
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems. Comput. Optim. Appl. 39(2): 219-238 (2008) - 2005
- [j20]Takahito Kuno:
A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems. J. Glob. Optim. 33(2): 215-234 (2005) - [j19]Yushan Zhu, Takahito Kuno:
A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem. J. Glob. Optim. 33(3): 435-464 (2005) - 2004
- [j18]Takahito Kuno, Jianming Shi:
Linear programs with an additional separable concave constraint. Adv. Decis. Sci. 8(3): 155-174 (2004) - 2002
- [j17]Takahito Kuno:
A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22(1-4): 155-174 (2002) - 2001
- [j16]Takahito Kuno:
A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming. Comput. Optim. Appl. 20(2): 119-135 (2001) - 2000
- [j15]Takahito Kuno, Takahiro Utsunomiya:
A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems. J. Glob. Optim. 18(1): 59-73 (2000)
1990 – 1999
- 1999
- [j14]Takahito Kuno, Hiroshi Konno, Akira Irie:
A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints. Comput. Optim. Appl. 14(3): 347-366 (1999) - [j13]Takahito Kuno:
Polynomial algorithms for a class of minimum rank-two cost path problems. J. Glob. Optim. 15(4): 405-417 (1999) - 1998
- [j12]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) - 1997
- [j11]Takahito Kuno:
A parametric approach for maximum flow problems with an additional reverse convex constraint. Ann. Oper. Res. 69: 261-276 (1997) - [j10]Takahito Kuno, Takahiro Utsunomiya:
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem. J. Glob. Optim. 11(2): 163-180 (1997) - [j9]Takahito Kuno, Takahiro Utsunomiya:
Minimizing a linear multiplicative-type function under network flow constraints. Oper. Res. Lett. 20(3): 141-148 (1997) - 1996
- [j8]Takahito Kuno, Takahiro Utsunomiya:
A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost. J. Glob. Optim. 8(1): 67-80 (1996) - 1994
- [j7]Hiroshi Konno, Takahito Kuno, Yasutoshi Yajima:
Global minimization of a generalized convex multiplicative function. J. Glob. Optim. 4(1): 47-62 (1994) - 1993
- [j6]Takahito Kuno, Yasutoshi Yajima, Hiroshi Konno:
An outer approximation method for minimizing the product of several convex functions on a convex set. J. Glob. Optim. 3(3): 325-335 (1993) - [j5]Takahito Kuno:
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set. Oper. Res. Lett. 13(5): 295-303 (1993) - 1992
- [j4]Hiroshi Konno, Takahito Kuno, Yasutoshi Yajima:
Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial. Comput. Optim. Appl. 1(2): 227-239 (1992) - [j3]Hiroshi Konno, Takahito Kuno:
Linear multiplicative programming. Math. Program. 56: 51-64 (1992) - 1991
- [j2]Takahito Kuno, Hiroshi Konno:
A parametric successive underestimation method for convex multiplicative programming problems. J. Glob. Optim. 1(3): 267-285 (1991) - [j1]Takahito Kuno, Hiroshi Konno, Eitan Zemel:
A linear-time algorithm for solving continuous maximin knapsack problems. Oper. Res. Lett. 10(1): 23-26 (1991)
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:39 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:
