Ibaraki Toshihide

Toshihide Ibaraki

Information about the author Toshihide Ibaraki will soon be added to the site.
Found 46 papers in total
The use of dynamic programming in genetic algorithms for permutation problems
The use of dynamic programming in genetic algorithms for permutation problems
1996
To deal with computationally hard problems, approximate algorithms are used to provide...
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
1997
We consider the problem of asking whether a given d-dimensional rectangle R o is...
Complexity of the single vehicle scheduling problem on graphs
Complexity of the single vehicle scheduling problem on graphs
1997
Let G = ( V , E ) be a graph. The travel times w ( u , v ) and w ( v , u ) are...
Vehicle scheduling on a tree with release and handling times
Vehicle scheduling on a tree with release and handling times
1997
In this paper, the authors consider a single-vehicle scheduling problem on a...
A multisplitting method for symmetric linear complementarity problems
A multisplitting method for symmetric linear complementarity problems
1995
Over the years, many methods for solving the linear complementarity problem (LCP) have...
Hitting or avoiding balls in Euclidean space
Hitting or avoiding balls in Euclidean space
1997
The authors investigate the algorithmic complexity of several geometric problems of...
Vehicle scheduling on a tree to minimize maximum lateness
Vehicle scheduling on a tree to minimize maximum lateness
1996
In this paper the authors deal with a single-vehicle scheduling problem on a...
Implementing an efficient minimum capacity cut algorithm
Implementing an efficient minimum capacity cut algorithm
1994
In this paper, the authors present an efficient implementation for the O(mn+n 2...
A dynamic programming method for single machine scheduling
A dynamic programming method for single machine scheduling
1994
This paper treats the single machine scheduling problem that minimizes the sum of...
A successive over-relaxation method for quadratic programming problems with interval constraints
A successive over-relaxation method for quadratic programming problems with interval constraints
1993
Hildreth’s algorithm is a classical iterative method for solving strictly convex...
Recent developments of optimization algorithms
Recent developments of optimization algorithms
1993
This paper surveys recent developments of algorithms for solving various optimization...
A practical approach to decomposable nonlinear programming problems
A practical approach to decomposable nonlinear programming problems
1993
Nonlinear programming problems often contain two types of variables; one appears...
A successive quadratic programming decomposition method for large-scale nonlinear programming problems
A successive quadratic programming decomposition method for large-scale nonlinear programming problems
1991
Large-scale nonlinear programming problems usually contain a relatively small number...
A globally convergent Newton method for solving strongly monotone variational inequalities
A globally convergent Newton method for solving strongly monotone variational inequalities
1993
Variational inequality problems have been used to formulate and study equilibrium...
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
1992
Let MC stand for a class of logs (i.e., sequences of read/write steps) that are...
Optimal strategies for some team games
Optimal strategies for some team games
1992
Consider a game between teams A and B, consisting of a sequence of matches, where each...
Dual-based Newton methods for nonlinear minimum cost network flow problems
Dual-based Newton methods for nonlinear minimum cost network flow problems
1991
Nonlinear network optimization is of great importance not only in theory but also in...
A minimum time algorithm for the graph construction and the leader election problems in a distributed system
A minimum time algorithm for the graph construction and the leader election problems in a distributed system
1989
Given an asynchronous distributed system with an arbitrary topology, in which each...
Interior methods for nonlinear minimum cost network flow problems
Interior methods for nonlinear minimum cost network flow problems
1989
In this paper the authors propose practical algorithms for solving the nonlinear...
Cause-effect relationships and partially defined Boolean functions
Cause-effect relationships and partially defined Boolean functions
1988
This paper investigates the use of Boolean techniques in a systematic study of...
Enumerative approaches to combinatorial optimization-Part I
Enumerative approaches to combinatorial optimization-Part I
1987
Combinatorial Optimization Problems and their complexity are discussed including...
Enumerative approaches to combinatorial optimization-Part II
Enumerative approaches to combinatorial optimization-Part II
1987
In this second part dynamic programming algorithms are discussed. The relationship...
Papers per page: