A parametric successive underestimation method for convex multiplicative programming problems. - Takahito Kuno; Hiroshi Konno (J. Glob. Optim., 1991)

A linear-time algorithm for solving continuous maximin knapsack problems. - Takahito Kuno; Hiroshi Konno; Eitan Zemel (Oper. Res. Lett., 1991)

Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial. - Hiroshi Konno; Takahito Kuno; Yasutoshi Yajima (Comput. Optim. Appl., 1992)

Linear multiplicative programming. - Hiroshi Konno; Takahito Kuno (Math. Program., 1992)

An outer approximation method for minimizing the product of several convex functions on a convex set. - Takahito Kuno; Yasutoshi Yajima; Hiroshi Konno (J. Glob. Optim., 1993)

Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set. - Takahito Kuno (Oper. Res. Lett., 1993)

Global minimization of a generalized convex multiplicative function. - Hiroshi Konno; Takahito Kuno; Yasutoshi Yajima (J. Glob. Optim., 1994)

A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost. - Takahito Kuno; Takahiro Utsunomiya (J. Glob. Optim., 1996)

A parametric approach for maximum flow problems with an additional reverse convex constraint. - Takahito Kuno (Ann. Oper. Res., 1997)

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem. - Takahito Kuno; Takahiro Utsunomiya (J. Glob. Optim., 1997)

Minimizing a linear multiplicative-type function under network flow constraints. - Takahito Kuno; Takahiro Utsunomiya (Oper. Res. Lett., 1997)

A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs. - Takahito Kuno; Yoshitsugu Yamamoto (J. Glob. Optim., 1998)

A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints. - Takahito Kuno; Hiroshi Konno; Akira Irie (Comput. Optim. Appl., 1999)

Polynomial algorithms for a class of minimum rank-two cost path problems. - Takahito Kuno (J. Glob. Optim., 1999)

A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems. - Takahito Kuno; Takahiro Utsunomiya (J. Glob. Optim., 2000)

A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming. - Takahito Kuno (Comput. Optim. Appl., 2001)

A branch-and-bound algorithm for maximizing the sum of several linear ratios. - Takahito Kuno (J. Glob. Optim., 2002)

Linear programs with an additional separable concave constraint. - Takahito Kuno; Jianming Shi (Adv. Decis. Sci., 2004)

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems. - Takahito Kuno (J. Glob. Optim., 2005)

A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem. - Yushan Zhu; Takahito Kuno (J. Glob. Optim., 2005)

A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems. - Takahito Kuno; Hidetoshi Nagai (Comput. Optim. Appl., 2008)

A Cutting Hyperplane Method for Generalized Monotone Nonlipschitzian Multivalued Variational Inequalities. - Pham Ngoc Anh; Takahito Kuno (HPSC, 2009)

Global Optimization in Multiplicative Programming. - Takahito Kuno (Encyclopedia of Optimization, 2009)

Multiplicative Programming. - Takahito Kuno (Encyclopedia of Optimization, 2009)

A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies. - Takahito Kuno; Paul E. K. Buckland (J. Glob. Optim., 2012)

A practical but rigorous approach to sum-of-ratios optimization in geometric applications. - Takahito Kuno; Toshiyuki Masaki (Comput. Optim. Appl., 2013)

A convergent conical algorithm with $$ omega $$ ω -bisection for concave minimization. - Takahito Kuno; Tomohiro Ishihama (J. Glob. Optim., 2015)

A generalization of ( omega ) -subdivision ensuring convergence of the simplicial algorithm. - Takahito Kuno; Tomohiro Ishihama (Comput. Optim. Appl., 2016)

Deterministic Parameter Selection of Artificial Bee Colony Based on Diagonalization. - Marco Antônio Florenzano Mollinetti; Mario Tasso Ribeiro Serra Neto; Takahito Kuno (HIS, 2018)

A modified simplicial algorithm for convex maximization based on an extension of ω-subdivision. - Takahito Kuno (J. Glob. Optim., 2018)

Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm. - Takahito Kuno; Yoshio Sano; Takahiro Tsuruda (Optim. Lett., 2018)

A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal Problems. - Marco Antônio Florenzano Mollinetti; Bernardo Bentes Gatto; Mario Tasso Ribeiro Serra Neto; Takahito Kuno (Entropy, 2020)

A revision of the rectangular algorithm for a class of DC optimization problems. - Takahito Kuno (J. Glob. Optim., 2022)