Takahito Kuno - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2022

A revision of the rectangular algorithm for a class of DC optimization problemsTakahito Kuno. jgo, 83(2):187-200, 2022. [doi]

2020

A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal ProblemsMarco Antônio Florenzano Mollinetti, Bernardo Bentes Gatto, Mario Tasso Ribeiro Serra Neto, Takahito Kuno. entropy, 22(9):1004, 2020. [doi]

2018

A modified simplicial algorithm for convex maximization based on an extension of ω-subdivisionTakahito Kuno. jgo, 71(2):297-311, 2018. [doi]

Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithmTakahito Kuno, Yoshio Sano, Takahiro Tsuruda. ol, 12(5):933-943, 2018. [doi]

Deterministic Parameter Selection of Artificial Bee Colony Based on DiagonalizationMarco Antônio Florenzano Mollinetti, Mario Tasso Ribeiro Serra Neto, Takahito Kuno. his 2020: 85-95 [doi]

2016

A generalization of \(\omega \) -subdivision ensuring convergence of the simplicial algorithmTakahito Kuno, Tomohiro Ishihama. coap, 64(2):535-555, 2016. [doi]

2015

A convergent conical algorithm with $$\omega $$ ω -bisection for concave minimizationTakahito Kuno, Tomohiro Ishihama. jgo, 61(2):203-220, 2015. [doi]

2013

A practical but rigorous approach to sum-of-ratios optimization in geometric applicationsTakahito Kuno, Toshiyuki Masaki. coap, 54(1):93-109, 2013. [doi]

2012

A convergent simplicial algorithm with ω-subdivision and ω-bisection strategiesTakahito Kuno, Paul E. K. Buckland. jgo, 52(3):371-390, 2012. [doi]

2009

A Cutting Hyperplane Method for Generalized Monotone Nonlipschitzian Multivalued Variational InequalitiesPham Ngoc Anh, Takahito Kuno. hpsc 2012: 1-11 [doi]

2008

A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problemsTakahito Kuno, Hidetoshi Nagai. coap, 39(2):219-238, 2008. [doi]

2005

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios ProblemsTakahito Kuno. jgo, 33(2):215-234, 2005. [doi]

A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization ProblemYushan Zhu, Takahito Kuno. jgo, 33(3):435-464, 2005. [doi]

2004

Linear programs with an additional separable concave constraintTakahito Kuno, Jianming Shi. jamds, 8(3):155-174, 2004. [doi]

2002

A branch-and-bound algorithm for maximizing the sum of several linear ratiosTakahito Kuno. jgo, 22(1-4):155-174, 2002. [doi]

2001

A Finite Branch-and-Bound Algorithm for Linear Multiplicative ProgrammingTakahito Kuno. coap, 20(2):119-135, 2001. [doi]

2000

A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation ProblemsTakahito Kuno, Takahiro Utsunomiya. jgo, 18(1):59-73, 2000. [doi]

1999

A Deterministic Approach to Linear Programs with Several Additional Multiplicative ConstraintsTakahito Kuno, Hiroshi Konno, Akira Irie. coap, 14(3):347-366, 1999. [doi]

Polynomial algorithms for a class of minimum rank-two cost path problemsTakahito Kuno. jgo, 15(4):405-417, 1999. [doi]

1998

A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex ProgramsTakahito Kuno, Yoshitsugu Yamamoto. jgo, 12(3):247-265, 1998. [doi]

1997

Minimizing a linear multiplicative-type function under network flow constraintsTakahito Kuno, Takahiro Utsunomiya. orl, 20(3):141-148, 1997. [doi]

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation ProblemTakahito Kuno, Takahiro Utsunomiya. jgo, 11(2):163-180, 1997. [doi]

A parametric approach for maximum flow problems with an additional reverse convex constraintTakahito Kuno. anor, 69:261-276, 1997. [doi]

1996

A decomposition algorithm for solving certain classes of production-transportation problems with concave production costTakahito Kuno, Takahiro Utsunomiya. jgo, 8(1):67-80, 1996. [doi]

1994

Global minimization of a generalized convex multiplicative functionHiroshi Konno, Takahito Kuno, Yasutoshi Yajima. jgo, 4(1):47-62, 1994. [doi]

1993

An outer approximation method for minimizing the product of several convex functions on a convex setTakahito Kuno, Yasutoshi Yajima, Hiroshi Konno. jgo, 3(3):325-335, 1993. [doi]

Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional setTakahito Kuno. orl, 13(5):295-303, 1993. [doi]

1992

Linear multiplicative programmingHiroshi Konno, Takahito Kuno. mp, 56:51-64, 1992.

Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomialHiroshi Konno, Takahito Kuno, Yasutoshi Yajima. coap, 1(2):227-239, 1992. [doi]

1991

A parametric successive underestimation method for convex multiplicative programming problemsTakahito Kuno, Hiroshi Konno. jgo, 1(3):267-285, 1991. [doi]

A linear-time algorithm for solving continuous maximin knapsack problemsTakahito Kuno, Hiroshi Konno, Eitan Zemel. orl, 10(1):23-26, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL