Takahito Kuno

According to our database1, Takahito Kuno authored at least 32 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal Problems.
Entropy, 2020

2018
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm.
Optim. Lett., 2018

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

Deterministic Parameter Selection of Artificial Bee Colony Based on Diagonalization.
Proceedings of the Hybrid Intelligent Systems, 2018

2016
A generalization of \(\omega \) -subdivision ensuring convergence of the simplicial algorithm.
Comput. Optim. Appl., 2016

2015
A convergent conical algorithm with $$\omega $$ ω -bisection for concave minimization.
J. Glob. Optim., 2015

2013
A practical but rigorous approach to sum-of-ratios optimization in geometric applications.
Comput. Optim. Appl., 2013

2012
A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies.
J. Glob. Optim., 2012

2009
Multiplicative Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Global Optimization in Multiplicative Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Cutting Hyperplane Method for Generalized Monotone Nonlipschitzian Multivalued Variational Inequalities.
Proceedings of the Modeling, 2009

2008
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems.
Comput. Optim. Appl., 2008

2005
A Global Optimization Method, QBB, for Twice-Differentiable Nonconvex Optimization Problem.
J. Glob. Optim., 2005

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

2004
Linear programs with an additional separable concave constraint.
Adv. Decis. Sci., 2004

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

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

2000
A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems.
J. Glob. Optim., 2000

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

A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints.
Comput. Optim. Appl., 1999

1998
A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs.
J. Glob. Optim., 1998

1997
Minimizing a linear multiplicative-type function under network flow constraints.
Oper. Res. Lett., 1997

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem.
J. Glob. Optim., 1997

A parametric approach for maximum flow problems with an additional reverse convex constraint.
Ann. Oper. Res., 1997

1996
A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost.
J. Glob. Optim., 1996

1994
Global minimization of a generalized convex multiplicative function.
J. Glob. Optim., 1994

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

An outer approximation method for minimizing the product of several convex functions on a convex set.
J. Glob. Optim., 1993

1992
Linear multiplicative programming.
Math. Program., 1992

Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial.
Comput. Optim. Appl., 1992

1991
A linear-time algorithm for solving continuous maximin knapsack problems.
Oper. Res. Lett., 1991

A parametric successive underestimation method for convex multiplicative programming problems.
J. Glob. Optim., 1991


  Loading...