Toshihide Ibaraki

发表

Technical Note - Complementary Programming

Toshihide Ibaraki, T. Ibaraki, 1971, Oper. Res..

Proceedings of the International Symposium on Algorithms

Toshihide Ibaraki, Tetsuo Asano, Hiroshi Imai, 1990 .

Minimal Representations of Some Classes of Dynamic Programming

Toshihide Ibaraki, T. Ibaraki, 1975, Inf. Control..

On the Difference of Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1999, STACS.

Multicommodity flows in certain planar directed networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1990, Discret. Appl. Math..

Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2005, Algorithmica.

A Metaheuristic Approach to the Resource Constrained Project Scheduling with Variable Activity Durations and Convex Cost Functions

Toshihide Ibaraki, Koji Nonobe, 2006 .

Scheduling of Shift Operations in a Container Terminal

Toshihide Ibaraki, Mutsunori Yagiura, Nobuyuki Kawai, 1997 .

Recognition and dualization of disguised bidual Horn functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2002, Inf. Process. Lett..

Minimum Edge Ranking Spanning Trees of Threshold Graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2002, ISAAC.

Logical analysis of numerical data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1997, Math. Program..

Interior Point Method

Toshihide Ibaraki, T. Ibaraki, 1996 .

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Toshihide Ibaraki, Takeaki Uno, Mutsunori Yagiura, 2005, Transp. Sci..

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999, J. Algorithms.

Ordered binary decision diagrams as knowledge-bases

Toshihide Ibaraki, Takashi Horiyama, 2002, Artif. Intell..

Preface

Toshihide Ibaraki, Maurice Queyranne, Rainer E. Burkard, 1995, Ann. Oper. Res..

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge

Toshihide Ibaraki, Kazuya Haraguchi, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

An Algorithm for the K Best Solutions of the Resource Allocation Problem

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1981, JACM.

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 2002, Networks.

Chain packing in graphs

Toshihide Ibaraki, Shigeru Masuyama, 2005, Algorithmica.

Parametric approaches to fractional programs

Toshihide Ibaraki, T. Ibaraki, 1983, Math. Program..

A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

Toshihide Ibaraki, Hisashi Mine, Hiroshi Kise, 1978, Oper. Res..

Cautious Transaction Schedulers with k Versions

Toshihide Ibaraki, Shigeru Masuyama, Makoto Takeda, 1988, Systems and Computers in Japan.

Inner-core and Outer-core Functions of Partially Defined Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1999, Discret. Appl. Math..

Simulated annealing and tabu search

Toshihide Ibaraki, T. Ibaraki, 1997 .

Technical Note - The Use of Cuts in Complementary Programming

Toshihide Ibaraki, 1973, Oper. Res..

Bisecting Two Subsets in 3-Connected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 1999, ISAAC.

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1996, STOC '96.

Finding Essential Attributes in Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2000, IDEAL.

On Minimal Test Sets for Locating Single Link Failures in Networks

Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida, 1981, IEEE Transactions on Computers.

An Algorithm for the Equipollent Resource Allocation Problem

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1985, Math. Oper. Res..

A Note on Minimizing Submodular Functions

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1998, Inf. Process. Lett..

A fast algorithm for computing minimum 3-way and 4-way cuts

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999, Math. Program..

Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1980 .

On functional dependencies in q-Horn theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 2001, Artif. Intell..

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 1999, J. Comb. Optim..

On the efficiency of cautious schedulers for database concurrency control—Why insist on two-phase locking?

Toshihide Ibaraki, Shojiro Nishio, Shinichi Taniguchi, 2004, Real-Time Systems.

Promenade of Applied Mathematics (51) : Thirty Five Years of NP Hardness : Road to its Conquest(Forum)

Toshihide Ibaraki, 2007 .

Complexity of Identification and Dualization of Positive Boolean Functions

Toshihide Ibaraki, Jan C. Bioch, 1995, Inf. Comput..

Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems

Toshihide Ibaraki, T. Ibaraki, 1978, Inf. Control..

Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)

Toshihide Ibaraki, 1997, ISAAC.

Reasoning with ordered binary decision diagrams

Toshihide Ibaraki, Takashi Horiyama, 2004, Discret. Appl. Math..

Disjunctions of Horn Theories and Their Cores

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2001, SIAM J. Comput..

Adaptive Linear Classifier by Linear Programming

Toshihide Ibaraki, Saburo Muroga, 1970, IEEE Trans. Syst. Sci. Cybern..

On arbitration for the Bayesian collective choiced problem

Toshihide Ibaraki, Ting Chen, Dao-Zhi Zeng, 1995 .

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1992, Algorithmica.

Lowering eccentricity of a tree by node upgrading

Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang, 2005, Networks.

Gate-Interconnection Minimization of Switching Networks Using Negative Gates

Toshihide Ibaraki, 1971, IEEE Transactions on Computers.

Generalization of Alpha-Beta and SSS Search Procedures

Toshihide Ibaraki, T. Ibaraki, 1986, Artif. Intell..

An Index for the Data Size to Extract Decomposable Structures in LAD

Toshihide Ibaraki, Mutsunori Yagiura, Hirotaka Ono, 2001, ISAAC.

Logical analysis of data with decomposable structures

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2000, Theor. Comput. Sci..

Interior and exterior functions of positive Boolean functions

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2003, Discret. Appl. Math..

Scheduling of Valve Operations in Fuel Supply Facilities

Toshihide Ibaraki, Hajime Ase, T. Ibaraki, 1998 .

Distributed database concurrency control by cautious schedulers with a central clock site

Toshihide Ibaraki, Jigui Li, 1990, Systems and Computers in Japan.

Reconfiguration of a fault-tolerant rectangular systolic array

Toshihide Ibaraki, Masafumi Yamashita, Tomio Hirata, 1988, Systems and Computers in Japan.

Logical Analysis of Data with Decomposable Structures

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2000, COCOON.

Algorithmic Aspects of Graph Connectivity

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2008, Encyclopedia of Mathematics and its Applications.

One-dimensional cutting stock problem to minimize the number of different patterns

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2003, Eur. J. Oper. Res..

An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products

Toshihide Ibaraki, Susumu Suzuki, T. Ibaraki, 2004, Informatica.

Correction to"State-Space MethodsforDesigning Digi- talSimulations ofContinuous FixedLinear Systems"

Toshihide Ibaraki, Shuzo Yajima, Ietoshi Kawano, 1968 .

Polyhedral structure of submodular and posi-modular systems

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1998, Discret. Appl. Math..

Optimal strategies for some team games

Toshihide Ibaraki, Naoki Katoh, Junji Koyanagi, 1992, Discret. Appl. Math..

Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices

Toshihide Ibaraki, Peter L. Hammer, Yves Crama, 1990, Math. Oper. Res..

Automated Two-machine Flowshop Scheduling: A Solvable Case

Toshihide Ibaraki, Tadayoshi Shioyama, Hiroshi Kise, 1991 .

A personal perspective on problem solving by general purpose solvers

Toshihide Ibaraki, 2010, Int. Trans. Oper. Res..

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities

Masao Fukushima, Toshihide Ibaraki, Hiroshi Nagamochi, 1990, Networks.

Data Analysis by Positive Decision Trees

Toshihide Ibaraki, Kazuhisa Makino, Takashi Suda, 1999, CODAS.

Algorithms and Computation

J. van Leeuwen, Toshihide Ibaraki, Jan van Leeuwen, 2003, Lecture Notes in Computer Science.

An Ejection Chain Approach for the Generalized Assignment Problem

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2004, INFORMS J. Comput..

A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1979 .

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, 1998, J. Algorithms.

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2003, Inf. Process. Lett..

Computing edge-connectivity augmentation function in Õ(nm) time

Toshihide Ibaraki, Hiroshi Nagamochi, Takashi Shiraki, 1997, SODA '97.

Preface: Mathematics of Industrial Systems III

Toshihide Ibaraki, Rainer E. Burkard, William R. Pulleyblank, 1998, Ann. Oper. Res..

1A1 Scheduling of Corrugated Paper Production(Technical session 1A: Combinatorial optimization)

Toshihide Ibaraki, Hiroyoshi Miwa, Kazuki Matsumoto, 2006 .

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem

Fred W. Glover, Toshihide Ibaraki, Hiroshi Nagamochi, 2007, SLS.

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy

Toshihide Ibaraki, Masafumi Yamashita, Namio Honda, 1987, Systems and Computers in Japan.

Augmenting Edge and Vertex Connectivities Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997, ISAAC.

Design of Minimum-Cost Deadlock-Free Systems

Hussein M. Abdel-Wahab, Toshihide Ibaraki, Tiko Kameda, 1983, JACM.

Studies on the Design of Minimal Logic Networks

Toshihide Ibaraki, T. Ibaraki, 1970 .

On Genetic Crossover Operators for Sequencing Problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1994 .

Augmenting a Submodular and Posi-modular Set Function by a Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Takashi Shiraki, 2001, J. Comb. Optim..

On Disguised Double Horn Functions and Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, STACS.

Design of Optimal Switching Networks by Integer Programming

Toshihide Ibaraki, Saburo Muroga, 1972, IEEE Transactions on Computers.

Computing All Small Cuts in Undirected Networks

Toshihide Ibaraki, Hiroshi Nagamochi, Kazuhiro Nishimura, 1994, ISAAC.

Finite Automata Having Cost Functions: Nondeterministic Models

Toshihide Ibaraki, 1978, Inf. Control..

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, 1997, J. Comb. Optim..

Ordered Binary Decision Diagrams Representing Knowledge-Bases (Models of Computation and Algorithms)

Toshihide Ibaraki, Takashi Horiyama, 1999 .

An Implementation of Logical Analysis of Data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2000, IEEE Trans. Knowl. Data Eng..

Preface

Toshihide Ibaraki, Maurice Queyranne, Rainer E. Burkard, 1997, Ann. Oper. Res..

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2004, Discret. Optim..

ITC-2007 Track2: An Approach using General CSP Solver

Toshihide Ibaraki, Koji Nonobe, Mitsunori Atsuta, 2007 .

Implementation of Parallel Prolog on Tree Machines

Toshihide Ibaraki, Masafumi Yamashita, Masaharu Imai, 1986, FJCC.

Representation Theorems for Equivalent Optimization Problems

Toshihide Ibaraki, T. Ibaraki, 1972, Inf. Control..

Removal Scheduling of a Multi-Story Mechanical Parking Facility

Toshihide Ibaraki, Mutsunori Yagiura, Hajime Ase, 1999 .

Strong unimodularity for matrices and hypergraphs

Toshihide Ibaraki, Peter L. Hammer, Yves Crama, 1986, Discret. Appl. Math..

An efficient algorithm for K shortest simple paths

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1982, Networks.

5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2006 .

4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2004 .

An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions

Toshihide Ibaraki, Susumu Suzuki, 2004, CCCG.

Preface

Toshihide Ibaraki, Rainer E. Burkard, William R. Pulleyblank, 2001, Ann. Oper. Res..

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1998, Inf. Comput..

Vehicle Scheduling on a Tree with Release and Handling Times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1993, ISAAC.

A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, 1999, IPCO.

Classes of Discrete Optimization Problems and Their Decision Problems

Toshihide Ibaraki, 1974, J. Comput. Syst. Sci..

Average running time analysis of an algorithm to calculate the size of the union of Cartesian products

Toshihide Ibaraki, Susumu Suzuki, 2003, Discret. Math..

A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2007, SLS.

A Local Search Approach to the Resource Constrained Project Scheduling Problem to Minimize Convex Costs

Toshihide Ibaraki, Koji Nonobe, 2001 .

A Theory of Coteries: Mutual Exclusion in Distributed Systems

Toshihide Ibaraki, Tiko Kameda, T. Kameda, 1993, IEEE Trans. Parallel Distributed Syst..

Preface

Toshihide Ibaraki, 1990, Discret. Appl. Math..

A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1987, Discret. Appl. Math..

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns

Toshihide Ibaraki, Endre Boros, Mutsunori Yagiura, 2008, IEICE Trans. Inf. Syst..

Uses of problem-specific heuristics

Toshihide Ibaraki, T. Ibaraki, 1997 .

Proceedings of the Third International Symposium on Algorithms and Computation

Toshihide Ibaraki, Takao Nishizeki, Masafumi Yamashita, 1992 .

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2001, J. Comb. Optim..

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, Jan C. Bioch, 1997, Discret. Appl. Math..

Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem

Toshihide Ibaraki, Koji Nonobe, T. Ibaraki, 2002 .

A PROPOSAL FOR THE LABORATORY ASSIGNMENT PROBLEM OF STUDENTS AND ITS MATHEMATICAL PROPERTIES

Toshihide Ibaraki, Toru Kataoka, 2008 .

Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent--Task Relationships

Toshihide Ibaraki, Konstantin Kogan, Eugene Khmelnitsky, 2005, J. Glob. Optim..

Duality in option pricing based on prices of other derivatives

Toshihide Ibaraki, Mutsunori Yagiura, Michi Nishihara, 2007, Oper. Res. Lett..

Collision Probability in an In-Line Equipment Model under Erlang Distribution

Toshihide Ibaraki, Hiroshi Fujiwara, Eishi Chiba, 2013, IEICE Trans. Inf. Syst..

Computational complexity of the file allocation problem in distributed database systems

Toshihide Ibaraki, Tomio Hirata, Masaharu Imai, 1988, Systems and Computers in Japan.

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree

Toshihide Ibaraki, Hiroshi Nagamochi, 1999, COCOON.

On generalized greedy splitting algorithms for multiway partition problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2004, Discret. Appl. Math..

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1997, SIAM J. Comput..

Positive and Horn Decomposability of Partially Defined Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, Kojin Yano, 1997, Discret. Appl. Math..

Solving the irregular strip packing problem via guided local search for overlap minimization

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2009, Int. Trans. Oper. Res..

A tabu search approach to the constraint satisfaction problem as a general problem solver

Toshihide Ibaraki, Koji Nonobe, T. Ibaraki, 1998, Eur. J. Oper. Res..

Monotone Extensions of Boolean Data Sets

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1997, ALT.

Fail-Safe Realization of Sequential Machines

Toshihide Ibaraki, Tadao Takaoka, T. Ibaraki, 1973, Inf. Control..

The Framework of Metaheuristics

Toshihide Ibaraki, Mutsunori Yagiura, 2001 .

K1 BUILDING GENERAL SOLVERS FOR SCHEDULING PROBLEMS(Keynote speech)

Toshihide Ibaraki, 2004 .

Efficient branch-and-bound algorithms for weighted MAX-2-SAT

Toshihide Ibaraki, Hiroshi Nagamochi, Mutsunori Yagiura, 2011, Math. Program..

Decomposability of Partially Defined Boolean Functions

Vladimir Gurvich, Toshihide Ibaraki, Endre Boros, 1995, Discret. Appl. Math..

Hitting or avoiding balls in Euclidean space

Toshihide Ibaraki, Yves Crama, 1997, Ann. Oper. Res..

CAUSE-EFFECT RELATIONSHIPS AND PARTIALLY DEFINED

Toshihide Ibaraki, Peter L. Hammer, Yves Crama, 1988 .

Recent progress of local search in handling the time window constraints of the vehicle routing problem

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2010, 4OR.

Totally balanced combinatorial optimization games

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 2000, Math. Program..

Primal-dual proximal point algorithm for linearly constrained convex programming problems

Masao Fukushima, Toshihide Ibaraki, Satoru Ibaraki, 1992, Comput. Optim. Appl..

An Algorithm for Finding K Minimum Spanning Trees

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1981, SIAM J. Comput..

Approximate evaluation of the computing cost for answering queries in deductive databases

Toshihide Ibaraki, Yushi Uno, 1993 .

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1999, ESA.

Methods of Combinatorial Optimization

Toshihide Ibaraki, 1994 .

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2008, Discret. Optim..

Multiversion Cautious Schedulers for Database Concurrency Control

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1990, IEEE Trans. Software Eng..

Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks

Toshihide Ibaraki, Saburo Muroga, Charles R. Baugh, 1971, Oper. Res..

Interior and Exterior Functions of Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1996, Discret. Appl. Math..

Special Issue on Algorithm Engineering : Surveys

Toshihide Ibaraki, Masafumi Yamashita, 2000 .

Ordered Binary Decision Diagrams as Knowledge-Bases

Toshihide Ibaraki, Takashi Horiyama, 1999, ISAAC.

Implementing an efficient minimum capacity cut algorithm

Toshihide Ibaraki, Hiroshi Nagamochi, Tadashi Ono, 1994, Math. Program..

Two Arc-Disjoint Paths in Eulerian Digraphs

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1998, SIAM J. Discret. Math..

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1999, J. Comb. Optim..

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1992, Discret. Appl. Math..

Serializability with constraints

Toshihide Ibaraki, Toshimi Minoura, Tiko Kameda, 1987, TODS.

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1998, COCOON.

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Shigeki Katayama, 2000, J. Comb. Optim..

Fractional knapsack problems

Toshihide Ibaraki, Hiroaki Ishii, Hisashi Mine, 1977, Math. Program..

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1995, IPCO.

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 2003, Annals of Mathematics and Artificial Intelligence.

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2001, STACS.

Disjunctions of Horn Theories and Their Cores

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, ISAAC.

On the average optimality of circular assignment policy

Toshihide Ibaraki, Katsuhisa Ohno, Masamitsu Ohnishi, 1992, Queueing Syst. Theory Appl..

Cautious Transaction Schedulers for Database

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1988 .

A Theory of Coteries: Exclusion in Distributed

Toshihide Ibaraki, T. Ibaraki, 1993 .

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2000, J. Comb. Optim..

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Hybrid Metaheuristics for Packing Problems

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2007 .

Algorithmic Aspects of Graph Connectivity: Bibliography

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2008 .

A 3-flip neighborhood local search for the set covering problem

Toshihide Ibaraki, Mutsunori Yagiura, Masahiro Kishida, 2006, Eur. J. Oper. Res..

Translation among CNFs, characteristic models and ordered binary decision diagrams

Toshihide Ibaraki, Takashi Horiyama, 2003, Inf. Process. Lett..

A path relinking approach with ejection chains for the generalized assignment problem

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2006, Eur. J. Oper. Res..

Theoretical comparisons of search strategies in branch-and-bound algorithms

Toshihide Ibaraki, T. Ibaraki, 1976, International Journal of Computer & Information Sciences.

On sparse subgraphs preserving connectivity properties

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1993, J. Graph Theory.

Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams

Toshihide Ibaraki, Takashi Horiyama, 2001, ISAAC.

Reasoning with Ordered Binary Decision Diagrams

Toshihide Ibaraki, Takashi Horiyama, 2000, ISAAC.

Convex Embeddings and Bisections of 3-Connected Graphs1

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 2002, Comb..

Graph connectivity and its augmentation: applications of MA orderings

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2002, Discret. Appl. Math..

Optimal coteries for rings and related networks

Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda, 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

Bidual Horn Functions and Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1999, Discret. Appl. Math..

Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997 .

Variations on extending partially defined Boolean functions with missing bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Inf. Comput..

Combination with local search

Toshihide Ibaraki, 1997 .

Searching minimax game trees under memory space constraint

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1990, Annals of Mathematics and Artificial Intelligence.

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1995, J. Algorithms.

A cautious scheduler for multistep transactions

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 2005, Algorithmica.

A Network Model for Dynamic Traffic Assignment

Masao Fukushima, Toshihide Ibaraki, Masayuki Tsujino, 1992 .

Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle

Toshihide Ibaraki, Konstantin Kogan, T. Ibaraki, 2000, J. Glob. Optim..

Combination with dynamic programming

Toshihide Ibaraki, T. Ibaraki, 1997 .

Deadlock-Free Systems for a Bounded Number of Processes

Toshihide Ibaraki, Tsunehiko Kameda, T. Ibaraki, 1982, IEEE Transactions on Computers.

Algorithms and Computation

Toshihide Ibaraki, Takao Nishizeki, Masafumi Yamashita, 1992, Lecture Notes in Computer Science.

Game Solving Procedure SSSR is Unsurpassed

Toshihide Ibaraki, Yoshiroh Katoh, T. Ibaraki, 1988, Systems and Computers in Japan.

On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1989, Inf. Process. Lett..

Integer Programming Approaches to the Problem of Network Upgrading

Toshihide Ibaraki, Masahiro Sasaki, Toshihide Nomura, 2008, 2008 International Symposium on Applications and the Internet.

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

Toshihide Ibaraki, Ramesh Krishnamurti, Daya Ram Gaur, 2000, ESA.

Boolean theory of coteries

Toshihide Ibaraki, Tiko Kameda, T. Kameda, 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

Boolean Analysis of Incomplete Examples

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1996, SWAT.

Approximate analysis of parallel machine scheduling problems.

Toshihide Ibaraki, Hiroshi Kise, Masahisa Kabata, 1985 .

Algorithmic Aspects of Graph Connectivity: Preface

Toshihide Ibaraki, Hiroshi Nagamochi, 2008 .

Computational Efficiency of Approximate Branch-and-Bound Algorithms

Toshihide Ibaraki, T. Ibaraki, 1976, Math. Oper. Res..

Collision Probability in an Automated Production Line under Erlang Distribution

Toshihide Ibaraki, Hiroshi Fujiwara, Eishi Chiba, 2007, 2007 IEEE International Conference on Research, Innovation and Vision for the Future.

Evaluating Queries in Deductive Databases by Using Relaxation Techniques

Toshihide Ibaraki, Susumu Suzuki, Masahichi Kishi, 1994 .

Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options

Toshihide Ibaraki, Michi Nishihara, Mutsunori Yagiura, 2010, Asia Pac. J. Oper. Res..

Hybrid Metaheuristics for Packing Problems

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2008, Hybrid Metaheuristics.

Logically Instantaneous Message Passing in Asynchronous Distributed Systems

Toshihide Ibaraki, Terunao Soneoka, 1994, IEEE Trans. Computers.

Evaluation of the File Redundancy in Distributed Database Systems

Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa, 1985, IEEE Transactions on Software Engineering.

One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2006, J. Math. Model. Algorithms.

A decomposability index in logical analysis of data

Toshihide Ibaraki, Mutsunori Yagiura, Hirotaka Ono, 2004, Discret. Appl. Math..

Using Relaxation Techniques to Evaluate Queries in Deductive Databases

Toshihide Ibaraki, Susumu Suzuki, Masahichi Kishi, 1991, DEXA.

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, J. Heuristics.

A globally convergent Newton method for solving strongly monotone variational inequalities

Masao Fukushima, Toshihide Ibaraki, Kouichi Taji, 1993, Math. Program..

File Redundancy Issues in Distributed Database Systems

Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa, 1983, VLDB.

Polyhedral Structure of Submodular and Posi-modular Systems

Toshihide Ibaraki, Hiroshi Nagamochi, 1998, ISAAC.

Generating and Approximating Nondominated Coteries

Toshihide Ibaraki, Jan C. Bioch, T. Ibaraki, 1995, IEEE Trans. Parallel Distributed Syst..

Local search algorithms for the rectangle packing problem with general spatial costs

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2003, Math. Program..

An efficient algorithm for the parametric resource allocation problem

Toshihide Ibaraki, Naoki Katoh, 1985, Discret. Appl. Math..

Computing Edge-Connectivity in Multiple and Capacitated Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, 1990, SIGAL International Symposium on Algorithms.

Finite State Representations of Discrete Optimization Problems

Toshihide Ibaraki, 1973, SIAM J. Comput..

Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products

Toshihide Ibaraki, Susumu Suzuki, 2001, Electron. Notes Discret. Math..

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1992, SIAM J. Discret. Math..

Decision lists and related Boolean functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2002, Theor. Comput. Sci..

Computing Intersections of Horn Theories for Reasoning with Models

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, Artif. Intell..

Parallel searches of game trees

Toshihide Ibaraki, Masafumi Yamashita, Masaharu Imai, 1987, Systems and Computers in Japan.

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1991, ISA.

Recent progress of local search in handling the time window constraints of the vehicle routing problem

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2013, Ann. Oper. Res..

On Autonomous Logic Nets of Threshold Elements

Toshihide Ibaraki, Shuzo Yajima, I. Kawano, 1968, IEEE Transactions on Computers.

Knowledge based support vector machines

Toshihide Ibaraki, Takuro Fukunaga, 2005 .

On Minimum Edge Ranking Spanning Trees

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 1999, MFCS.

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Shigeki Katayama, 1999, J. Comb. Optim..

Metaheuristics as robust and simple optimization tools

Toshihide Ibaraki, Mutsunori Yagiura, 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

Multigraph augmentation under biconnectivity and general edge-connectivity requirements

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2001, Networks.

Cautious transaction schedulers with admission control

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1985, TODS.

Vehicle scheduling on a tree with release and handling times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1997, Ann. Oper. Res..

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1995, IFIP TCS.

Comparison with existing optimization methods

Toshihide Ibaraki, 1997 .

Algorithms and Computation: Third International Symposium, Isaac '92, Nagoya, Japan, December 16-18, 1992 : Proceedings

Toshihide Ibaraki, Yasuyoshi Inagaki, K. Iwana, 1992 .

The vehicle routing problem with flexible time windows and traveling times

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2006, Discret. Appl. Math..

Functional Dependencies in Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 1999, Artif. Intell..

A 1.5-Approximation for Single-Vehicle Scheduling Problem on a Line with Release and Handling Times

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno, 1998 .

Double Horn Functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, Inf. Comput..

Optimal augmentation to make a graph k-edge-connected and triconnected

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, SODA '98.

Finding Essential Attributes from Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Annals of Mathematics and Artificial Intelligence.

Incoming and Outgoing Scheduling of a Multi-Story Mechanical Parking Facility

Toshihide Ibaraki, Mutsunori Yagiura, Hajime Ase, 2000 .

Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings

Toshihide Ibaraki, Tetsuo Asano, Hiroshi Imai, 1990, SIGAL International Symposium on Algorithms.

On metaheuristic algorithms for combinatorial optimization problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, Syst. Comput. Jpn..

Preface

Toshihide Ibaraki, Komei Fukuda, 1995, Discret. Appl. Math..

The complexity of assigning genotypes to people in a pedigree consistently

Toshihide Ibaraki, Susumu Suzuki, 2007, Discret. Math..

Weak Three-Linking in Eulerian Digraphs

Toshihide Ibaraki, Svatopluk Poljak, T. Ibaraki, 1991, SIAM J. Discret. Math..

The Maximum Latency and Identification of Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, 1994, ISAAC.

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

Toshihide Ibaraki, Takeaki Uno, Mutsunori Yagiura, 2008, Discret. Appl. Math..

On the Difference of Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2000, J. Comput. Syst. Sci..

Maximum flows in probabilistic networks

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1991, Networks.

MINIMUM DELAY SEMIJOIN SCHEDULES FOR LOCAL AREA DISTRIBUTED DATABASE SYSTEMS(Mathematical Theories on Computing Schemes and Their Applications)

Toshihide Ibaraki, Shojiro Muro, Shigeru Masuyama, 1983 .

The number of additional variables required for the integer programming formulation

Toshihide Ibaraki, 1980, Discret. Appl. Math..

On the optimal nesting order for computing N-relational joins

Toshihide Ibaraki, Tiko Kameda, T. Kameda, 1984, TODS.

Cautious Transaction Schedulers for Database Concurrency Control

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1988, IEEE Trans. Software Eng..

On Minimum Edge Ranking Spanning Trees

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2001, J. Algorithms.

Horn Extensions of a Partially Defined Boolean Function

Toshihide Ibaraki, Kazuhisa Makino, Ken'ichi Hatanaka, 1999, SIAM J. Comput..

On-Line Computation of Transitive Closures of Graphs

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1983, Inf. Process. Lett..

A Unified Framework for Approximating Multiway Partition Problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2009, ISAAC.

Scheduling of corrugated paper production

Toshihide Ibaraki, Hiroyoshi Miwa, Kazuki Matsumoto, 2009, Eur. J. Oper. Res..

Decompositions of positive self-dual boolean functions

Toshihide Ibaraki, Jan C. Bioch, T. Ibaraki, 1995, Discret. Math..

Boolean Normal Forms, Shellability, and Reliability Computations

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2000, SIAM J. Discret. Math..

Complexity of the Minimum Base Game on Matroids

Toshihide Ibaraki, Hiroshi Nagamochi, Dao-Zhi Zeng, 1997, Math. Oper. Res..

The Power of Dominance Relations in Branch-and-Bound Algorithms

Toshihide Ibaraki, T. Ibaraki, 1977, JACM.

Logical Analysis of Binary Data with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1999, Artif. Intell..

Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract)

Toshihide Ibaraki, Toshimi Minoura, Tiko Kameda, 1983, VLDB.

Special Section on Theoretical Foundation of Computing

Toshihide Ibaraki, Osamu Watanabe, 1992 .

Two-Face Horn Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1997, ISAAC.

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

Toshihide Ibaraki, Ramesh Krishnamurti, Daya Ram Gaur, 2000, J. Algorithms.

Two Arc Disjoint Paths in Eulerian Diagraphs

Toshihide Ibaraki, Hiroshi Nagamochi, András Frank, 1995, ISAAC.

Preface

Toshihide Ibaraki, Masao Iri, 1987, Discret. Appl. Math..

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, ISAAC.

Algorithmic Aspects of the Core of Combinatorial Optimization Games

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 1999, Math. Oper. Res..

Optimal coteries for rings and related networks

Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda, 2005, Distributed Computing.

Distances defined by neighborhood sequences

Toshihide Ibaraki, Masafumi Yamashita, M. Yamashita, 1986, Pattern Recognit..

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations

Toshihide Ibaraki, Hiroshi Nagamochi, Alexander V. Karzanov, 1998, Comb..

A Lower Bound of the Number of Threshold Functions

Toshihide Ibaraki, Shuzo Yajima, 1965, IEEE Trans. Electron. Comput..

Finite Automata Having Cost Functions

Toshihide Ibaraki, T. Ibaraki, 1976, Inf. Control..

Greedy splitting algorithms for approximating multiway partition problems

Toshihide Ibaraki, Hiroshi Nagamochi, Liang Zhao, 2005, Math. Program..

Optimal scheduling policies in time sharing service systems

Toshihide Ibaraki, H. Maeda, M. Ohnishi, 1995 .

Packing Problems with Soft Rectangles

Toshihide Ibaraki, Kouji Nakamura, T. Ibaraki, 2006, Hybrid Metaheuristics.

The Maximum Latency and Identification of Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1994, SIAM J. Comput..

Computing All Small Cuts in an Undirected Network

Toshihide Ibaraki, Hiroshi Nagamochi, Kazuhiro Nishimura, 1997, SIAM J. Discret. Math..

Metaheuristics and Lagrangian Relaxation(Special Issue on New Trends in Scheduling Technologies)

Toshihide Ibaraki, Mutsunori Yagiura, 2001 .

Resource allocation problems - algorithmic approaches

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1988, MIT Press series in the foundations of computing.

Shortest Semijoin Schedule for a Local Area Distributed Database System

Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa, 1987, IEEE Transactions on Software Engineering.

On metaheuristic algorithms for combinatorial optimization problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, Systems and Computers in Japan.

Lower bounds on time complexity for some subgraph detection problems

Toshihide Ibaraki, Masafumi Yamashita, Tomio Hirata, 1986, Systems and Computers in Japan.

Logical analysis of data: classification with justification

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2011, Ann. Oper. Res..

Using branch-and-bound algorithms to obtain suboptimal solutions

Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa, 1983, Z. Oper. Research.

N-Fail-Safe Sequential Machines

Toshihide Ibaraki, Tadao Takaoka, T. Ibaraki, 1972, IEEE Transactions on Computers.

A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, S. Nakamura, 2000, Algorithmica.

Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems

Toshihide Ibaraki, Yukihiro Nakamura, Ryouei Takahashi, 2018, ANTS Conference.

Metaheuristics : progress as real problem solvers

Toshihide Ibaraki, Mutsunori Yagiura, Koji Nonobe, 2005 .

Approximation algorithms for combinatorial fractional programming problems

Masao Fukushima, Toshihide Ibaraki, Naoki Katoh, 1987, Math. Program..

Generalized Assignment Problem

Toshihide Ibaraki, Mutsunori Yagiura, 2007, Handbook of Approximation Algorithms and Metaheuristics.

An implicit enumeration program for zero-one integer programming

Toshihide Ibaraki, Saburo Muroga, Charles R. Baugh, 2005, International Journal of Computer & Information Sciences.

Minimum edge ranking spanning trees of split graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2006, Discret. Appl. Math..

Depth-m search in branch-and-bound algorithms

Toshihide Ibaraki, 2004, International Journal of Computer & Information Sciences.

Logical Analysis of Data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2005 .

INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

Masao Fukushima, Toshihide Ibaraki, M. Fukushima, 1989 .

An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

Toshihide Ibaraki, Koji Nonobe, T. Ibaraki, 2001 .

ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1979 .

An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Reachability Problems of Random Digraphs

Toshihide Ibaraki, Yushi Uno, 1998 .

Minimal Test Set for Diagnosing a Tree System

Toshihide Ibaraki, Tiko Kameda, S. Toida, 1981 .

A globally convergent SQP method for semi-infinite nonlinear optimization

Masao Fukushima, Toshihide Ibaraki, Yoshihiro Tanaka, 1988 .

Some Duality Properties of Combinatorial Optimization Games(Optimization Theory in Descrete and Continuous Mathematical Sciences)

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng, 1997 .

Proceedings : International Conference on Informatics Research for Development of Knowledge Society Infrastructure : ICKS 2004 : 1-2 March 2004, Kyoto, Japan

Toshihide Ibaraki, Toshio Inui, T. Ibaraki, 2004 .

The Generalized Assignment Problem and Its Generalizations

Toshihide Ibaraki, Mutsunori Yagiura, 2010 .

Counting the number of minimum cuts in undirected multigraphs

Toshihide Ibaraki, Hiroshi Nagamochi, Z. Sun, 1991 .

Problem Solving by General Purpose Solvers

Toshihide Ibaraki, T. Ibaraki, 2008 .

Game Solving Procedure H* Is Unsurpassed

Toshihide Ibaraki, 1987 .

Complexity Of The Single Vehicle Scheduling Problem On Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Koji Mochizuki, 1997 .

The Use of Cuts in Complementary Programming

Toshihide Ibaraki, T. Ibaraki, 2016 .

An algorithm for the fair resource allocation problem with a submodular constraint

Toshihide Ibaraki, Kenji Namikawa, 1991 .

A multisplitting method for symmetric linear complementarity problems

Masao Fukushima, Toshihide Ibaraki, Naoki Machida, 1995 .

Double-offer arbitration

Toshihide Ibaraki, Dao-Zhi Zeng, Shinya Nakamura, 1996 .

Graph packing over a rooted tree

Toshihide Ibaraki, Hisashi Mine, Shigeru Masuyama, 1987 .

An approximation of the minimum vertex cover in a graph

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 1999 .

Approximability of the Minimum Maximal Matching Problem in Planar Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

A parallel relaxation method for quadratic programming problems with interval constraints

Masao Fukushima, Toshihide Ibaraki, Takanobu Sugimoto, 1995 .

Local Search Heuristics for the Rectangle Packing Problem with General Spatial Costs

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2001 .

Boolean Functions: Partially defined Boolean functions

Toshihide Ibaraki, 2011 .

A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS

Toshihide Ibaraki, Yoshikazu Shimazu, Maso Fukushima, 1993 .

Threshold Numbers and Threshold Completions

Toshihide Ibaraki, Peter L. Hammer, Uri N. Peled, 1981 .

A fast algorithm for cactus representations of minimum cuts

Toshihide Ibaraki, Hiroshi Nagamochi, T. Ibaraki, 2000 .

Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree

Toshihide Ibaraki, Hiroshi Nagamochi, Koji Mochizuki, 2001 .

APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS

Toshihide Ibaraki, 1980 .