What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Mathematical optimization
Toshihide Ibaraki mainly investigates Mathematical optimization, Algorithm, Combinatorics, Discrete mathematics and Time complexity.
His Mathematical optimization course of study focuses on Scheduling and Lagrange multiplier and Preemption.
He focuses mostly in the field of Combinatorics, narrowing it down to topics relating to Set and, in certain cases, Monotonic function and Class.
His work in the fields of Discrete mathematics, such as Hypergraph, Minimum degree spanning tree, Reverse-delete algorithm and Spanning tree, intersects with other areas such as Lambda.
Toshihide Ibaraki interconnects Boolean function and Flow network in the investigation of issues within Time complexity.
His Boolean function study incorporates themes from Computational complexity theory, Data mining and Boolean algebra.
His most cited work include:
- Resource Allocation Problems: Algorithmic Approaches (582 citations)
- An implementation of logical analysis of data (327 citations)
- Computing edge-connectivity in multigraphs and capacitated graphs (318 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Combinatorics, Discrete mathematics, Mathematical optimization, Algorithm and Time complexity.
The Combinatorics study combines topics in areas such as Function and Set.
His studies in Metaheuristic, Local search, Generalized assignment problem, Cutting stock problem and Tabu search are all subfields of Mathematical optimization research.
Algorithm and Upper and lower bounds are commonly linked in his work.
His Time complexity research incorporates themes from Computational complexity theory, Graph theory, Connectivity and Submodular set function.
He interconnects Polynomial, Monotonic function and Extension in the investigation of issues within Boolean function.
He most often published in these fields:
- Combinatorics (37.30%)
- Discrete mathematics (29.37%)
- Mathematical optimization (27.51%)
What were the highlights of his more recent work (between 2002-2018)?
- Mathematical optimization (27.51%)
- Algorithm (23.02%)
- Discrete mathematics (29.37%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Mathematical optimization, Algorithm, Discrete mathematics, Combinatorics and Local search.
His work in Algorithm is not limited to one particular discipline; it also encompasses Benchmark.
His Discrete mathematics research focuses on Submodular set function and how it relates to Greedy algorithm and Partition.
His work in Combinatorics covers topics such as Set which are related to areas like Lagrangian relaxation.
His research integrates issues of Computational complexity theory, Polynomial and Binary decision diagram in his study of Time complexity.
The concepts of his Boolean function study are interwoven with issues in Decision tree and Logical analysis of data.
Between 2002 and 2018, his most popular works were:
- Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints (137 citations)
- Metaheuristics : progress as real problem solvers (128 citations)
- An Ejection Chain Approach for the Generalized Assignment Problem (125 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Artificial intelligence
Mathematical optimization, Metaheuristic, Algorithm, Local search and Dynamic programming are his primary areas of study.
His work in Quadratic assignment problem, Generalized assignment problem and Weapon target assignment problem is related to Mathematical optimization.
His Algorithm research integrates issues from Minimization problem and Minification.
His studies deal with areas such as Cutting stock problem and Heuristic as well as Local search.
His Dynamic programming study also includes
- Piecewise linear function which connect with Penalty method,
- Vehicle routing problem, which have a strong connection to Scheduling, Real-time computing and Distributed computing,
- Job shop scheduling that intertwine with fields like Permutation and Set packing.
He has researched Generalization in several fields, including Discrete mathematics and Approximation algorithm, Combinatorics.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
