Toshihide Ibaraki

Publication Activity (10 Years)

Years Active: 1965-2018
Publications (10 Years): 1

Top Venues

IEICE Trans. Inf. Syst.

Ann. Oper. Res.

ANTS Conference

Publications

Ryouei Takahashi, Yukihiro Nakamura, Toshihide Ibaraki
Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems. ANTS Conference (2018)
Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki
Collision Probability in an In-Line Equipment Model under Erlang Distribution. IEICE Trans. Inf. Syst. (3) (2013)
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
Recent progress of local search in handling the time window constraints of the vehicle routing problem. Ann. Oper. Res. 204 (1) (2013)
Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
Logical analysis of data: classification with justification. Ann. Oper. Res. 188 (1) (2011)
Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program. 127 (2) (2011)
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. Asia Pac. J. Oper. Res. 27 (2) (2010)
Toshihide Ibaraki
A personal perspective on problem solving by general purpose solvers. Int. Trans. Oper. Res. 17 (3) (2010)
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8 (3) (2010)
Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki
Scheduling of corrugated paper production. Eur. J. Oper. Res. 192 (3) (2009)
Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki
Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16 (6) (2009)
Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discret. Appl. Math. 156 (11) (2008)
Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. (3) (2008)
Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki
Integer Programming Approaches to the Problem of Network Upgrading. SAINT (2008)
Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discret. Optim. 5 (2) (2008)
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35 (2) (2007)
Susumu Suzuki, Toshihide Ibaraki
The complexity of assigning genotypes to people in a pedigree consistently. Discret. Math. 307 (16) (2007)
Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki
Collision Probability in an Automated Production Line under Erlang Distribution. RIVF (2007)
Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. SLS (2007)
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS (2007)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. J. Math. Model. Algorithms 5 (1) (2006)
Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154 (16) (2006)
Toshihide Ibaraki, Kouji Nakamura
Packing Problems with Soft Rectangles. Hybrid Metaheuristics (2006)
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
Minimum edge ranking spanning trees of split graphs. Discret. Appl. Math. 154 (16) (2006)
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169 (2) (2006)
Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki
A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172 (2) (2006)
Kazuya Haraguchi, Toshihide Ibaraki
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44 (3) (2006)
Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transp. Sci. 39 (2) (2005)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102 (1) (2005)
Konstantin Kogan, Eugene Khmelnitsky, Toshihide Ibaraki
Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships. J. Glob. Optim. 31 (1) (2005)
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167 (1) (2005)
Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang
Lowering eccentricity of a tree by node upgrading. Networks 45 (4) (2005)
Susumu Suzuki, Toshihide Ibaraki
An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products. Informatica (Slovenia) 28 (3) (2004)
Susumu Suzuki, Toshihide Ibaraki
An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions. CCCG (2004)
Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret. Optim. 1 (1) (2004)
Takashi Horiyama, Toshihide Ibaraki
Reasoning with ordered binary decision diagrams. Discret. Appl. Math. 142 (1-3) (2004)
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
A decomposability index in logical analysis of data. Discret. Appl. Math. 142 (1-3) (2004)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
On generalized greedy splitting algorithms for multiway partition problems. Discret. Appl. Math. 143 (1-3) (2004)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. Hybrid Metaheuristics (2004)
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS J. Comput. 16 (2) (2004)
Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. 130 (3) (2003)
Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki
Approximability of the Minimum Maximal Matching Problem in Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2003)
Takashi Horiyama, Toshihide Ibaraki
Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85 (4) (2003)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. Ann. Math. Artif. Intell. 38 (4) (2003)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discret. Appl. Math. 126 (2-3) (2003)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146 (2) (2003)
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180 (1) (2003)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett. 86 (2) (2003)
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97 (3) (2003)
Susumu Suzuki, Toshihide Ibaraki
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. Discret. Math. 273 (1-3) (2003)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39 (3) (2003)
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
Convex Embeddings and Bisections of 3-Connected Graphs 1. Comb. 22 (4) (2002)
Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
Logical analysis of data with decomposable structures. Theor. Comput. Sci. 289 (2) (2002)
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC (2002)
Hiroshi Nagamochi, Toshihide Ibaraki
Graph connectivity and its augmentation: applications of MA orderings. Discret. Appl. Math. 123 (1-3) (2002)
Takashi Horiyama, Toshihide Ibaraki
Ordered binary decision diagrams as knowledge-bases. Artif. Intell. 136 (2) (2002)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. 82 (6) (2002)
Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. J. Algorithms 43 (1) (2002)
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39 (4) (2002)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Decision lists and related Boolean functions. Theor. Comput. Sci. 270 (1-2) (2002)
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC (2001)
Mutsunori Yagiura, Toshihide Ibaraki
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7 (5) (2001)
Mutsunori Yagiura, Toshihide Ibaraki
On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan 32 (3) (2001)
Susumu Suzuki, Toshihide Ibaraki
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products. Electron. Notes Discret. Math. 10 (2001)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. 31 (1) (2001)
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
On Minimum Edge Ranking Spanning Trees. J. Algorithms 38 (2) (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS (2001)
Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank
Preface. Ann. Oper. Res. 107 (1-4) (2001)
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim. 5 (2) (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A Unified Framework for Approximating Multiway Partition Problems. ISAAC (2001)
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
On functional dependencies in q-Horn theories. Artif. Intell. 131 (1-2) (2001)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37 (3) (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5 (4) (2001)
Takashi Horiyama, Toshihide Ibaraki
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. ISAAC (2001)
Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki
) Time Edge-Splitting Algorithm in Undirected Graphs. Algorithmica 26 (1) (2000)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
On the Difference of Horn Theories. J. Comput. Syst. Sci. 61 (3) (2000)
Hiroshi Nagamochi, Toshihide Ibaraki
Polyhedral structure of submodular and posi-modular systems. Discret. Appl. Math. 107 (1-3) (2000)
Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. 13 (2) (2000)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes in Binary Data. IDEAL (2000)
Konstantin Kogan, Toshihide Ibaraki
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle. J. Glob. Optim. 16 (3) (2000)
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. J. Comb. Optim. 4 (2) (2000)
Takashi Horiyama, Toshihide Ibaraki
Reasoning with Ordered Binary Decision Diagrams. ISAAC (2000)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. J. Comb. Optim. 4 (1) (2000)
Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
Logical Analysis of Data with Decomposable Structures. COCOON (2000)
Hiroshi Nagamochi, Toshihide Ibaraki
A fast algorithm for computing minimum 3-way and 4-way cuts. Math. Program. 88 (3) (2000)
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS (2000)
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang
Totally balanced combinatorial optimization games. Math. Program. 87 (3) (2000)
Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA (2000)
Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
An Implementation of Logical Analysis of Data. IEEE Trans. Knowl. Data Eng. 12 (2) (2000)
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
Functional Dependencies in Horn Theories. Artif. Intell. 108 (1-2) (1999)
Hiroshi Nagamochi, Toshihide Ibaraki
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON (1999)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. ESA (1999)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Bidual Horn Functions and Extensions. Discret. Appl. Math. (1999)
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
On the Difference of Horn Theories. STACS (1999)
Kazuhisa Makino, Toshihide Ibaraki
Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discret. Appl. Math. (1999)
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
On Minimum Edge Ranking Spanning Trees. MFCS (1999)
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107 (2) (1999)
Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki
Horn Extensions of a Partially Defined Boolean Function. SIAM J. Comput. 28 (6) (1999)
Mutsunori Yagiura, Toshihide Ibaraki
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3 (1) (1999)

Toshihide Ibaraki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Toshihide Ibaraki