Toshihide Ibaraki

Theoretical Computer Science, to appear. Decision Lists and Related Boolean Functions ¢¡¤£ (2008)

Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover

We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists has...

informs ®

References (2008)

Toshihide Ibaraki, Tiko Kameda, Ravi Krishnamurthy, Haran Boral, Carlo Zaniolo, Arjan Pellenkoft, ...

Optimizing large join queries using a graph-based approach.

Lowering Eccentricity of a Tree by Node-Upgrading (2008)

Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang

The eccentricity lowering problem is to reduce the eccentricity of a network by upgrading some nodes (i.e., shrinking the lengths of the edges incident to such nodes). We consider two types of...

Technical Report #99009 Ordered Binary Decision Diagrams as Knowledge-Bases (2008)

Takashi Horiyama, Toshihide Ibaraki

Abstract. We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some...

A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem (2008)

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover

Abstract: We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP). MRGAP is a generalization of the generalized assignment problem, which is one of the...

c (2008)

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino

d

A Set Covering Approach for the Pickup and Delivery Problem with Additional Constraints (Numerical Optimization methods, theory and applications) (2008)

Hashimoto, Hideki, Ezaki, Youichi, Ygiura, Mutsunori, Nonobe, Koji, Ibaraki, Toshihide, Lokketangen, Arne

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

HARAGUCHI, Kazuya, YAGIURA, Mutsunori, BOROS, Endre, IBARAKI, Toshihide

We consider a data set in which each example is an n-dimensional Boolean vector labeled as true or false. A pattern is a co-occurrence of a particular value combination of a given subset of the...

Ordered binary decision diagrams as knowledge-bases (2007)

Takashi Horiyama, Toshihide Ibaraki

Abstract. We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more ecient and suitable in some...

Implementing an Ecient Minimum Capacity Cut Algorithm (2007)

Hiroshi Nagamochi Tadashi, Toshihide Ibaraki

In this paper, we present an ecient implementation of the O(mn + n 2 log n) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected...

On Satisfiability of Partially Defined Double and Bidual Horn Functions (extended abstract) (2007)

Two Arc Disjoint Paths in Eulerian Digraphs (2007)

Introduction A partially defined Boolean function (pdBF) is a natural generalization of the familiar concept of Boolean function, by allowing that the function value on some vectors is unknown [5]....

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi

: Let G be an Eulerian digraph, and fx 1 ; x 2 g; fy 1 ; y 2 g be two pairs of vertices in G. A directed path from a vertex s to a vertex t is called a st-path. An instance (G; fx 1 ; x 2 g; fy 1 ; y...

MIC’2001- 4th Metaheuristics International Conference 69 A Local Search Approach for One Dimensional (2007)

Cutting Stock Problem, Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

One dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which has many applications in, e.g., steel, paper and fiber industries. To define an...

E-mail: (2007)

Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki

Abstract: The set covering problem (SCP) calls for a minimum cost family of subsets from n given subsets, which together covers the entire ground set. In this paper, we propose a local search...

+ Web Service Group, NTT Data Corporation (2007)

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki

We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP) [5]. MRGAP is a further generalization of the generalized assignment problem (GAP) [8, 10, 11],...

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

Hirotaka Oho, Mutsunori Yagiura, Toshihide Ibaraki

Abstract. Logical analysis of data (LAD) is one of the methodologies for extracting knowledge as a Boolean function f from a given pair of data sets (T,F) on attributes set $ of size n, in which T...

z (2007)

We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual f d. While this problem is not solvable in quasi-polynomial total time in general (unless...

z (2007)

Discrete Applied Mathematics, 96-97:55--88, 1999. Bidual Horn Functions and Extensions (2007)

Model-based reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic...

Running head: On the Dierence of Horn Theories Mailing address: (2007)

Partially defined Boolean functions (pdBf) (T; F), where T; F f0; 1g n are disjoint sets of true and false vectors, generalize total Boolean functions by allowing that the function values on some...

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

In this paper, we consider computing the dierence between two Horn theories. This problem may arise, for example, if we take care of a theory change in a knowledge base. In general, the dierence of...

On the Difference of Horn Theories (Extended Abstract) (2007)

Siam Journal on Computing, 31(1):269-288, 2001. Disjunctions of Horn Theories and their Cores (2007)

Abstract. In this paper, we consider computing the difference between two Horn theories. This problem may arise, for example, if we take care of a theory change in a knowledge base. In general, the...

Theoretical Computer Science, to appear. Decision Lists and Related Boolean Functions ;y (2007)

In this paper, we study issues on disjunctions of propositional Horn theories. In particular, we consider the problems of deciding whether a disjunction of Horn theories is Horn, and, if not,...

We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists has...

2 (2007)

Abstract. A partially dened Boolean function (pdBf) (T; F) generalizes a Boolean function, by allowing that the function values on some inputs are unknown, where T; F f0; 1g n are disjoint sets of...

2 (2007)

Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki

Abstract. In this paper, we study issues on disjunctions of propositional Horn theories. In particular, we consider deciding whether a disjunction of Horn theories is Horn, and, if not, computing a...

z (2007)

Abstract: The set covering problem (SCP) asks to choose a minimum cost family of subsets from given n subsets, which together covers the entire ground set. In this paper, we propose a local search...

PAPER A Simple Proof of a Minimum Cut Algorithm and Its Applications (2007)

Hiroshi Nagamochi, Toshimasa Ishii, Toshihide Ibaraki

c#CflGVflEC]# of the minimum c#C algorithm proposed in [H. Nagamoc hi and T. Ibaraki, omputing edge-c#gCwKwzGC] y of multigraphs and c#CflKwE#C]# graphs, SIAM J.Disc#zLC Mathematic#fl

A Very Large-Scale Neighborhood Search Algorithm (2007)

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover

We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP). MRGAP is a generalization of the generalized assignment problem, which is one of the representative...

Hybrid Metaheuristics for Packing Problems (2007)

Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the...

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge (2006)

HARAGUCHI, Kazuya, IBARAKI, Toshihide

We consider the classification problem to construct a classifier c :{0,1}n ↦ {0,1} from a given set of examples (training set), which (approximately) realizes the hidden...

Greedy splitting algorithms for approximating multiway partition problems (2005)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Abstract. Given a system (V, T, f, k), where V is a finite set, T ⊆ V, f: 2 V → R is a submodular function and k ≥ 2 is an integer, the general multiway partition problem (MPP) asks to find a...

Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns (Captivation of Convexity : Fascination of Nonconvexity) (2004)

Imahori, Shinji, Yagiura, Mutsunori, Adachi, Shinya, Ibaraki, Toshihide, Umetani, Shunji

A faster algorithm for two-variable integer programming (2003)

Eisenbrand, Friedrich, Laue, Soeren, Ibaraki, Toshihide, Katoh, Naoki, Ono, Hirotaka

We show that a 2-variable integer program, defined by $m$ constraints involving coefficients with at most $\varphi$ bits can be solved with $O(m + \varphi)$ arithmetic operations on rational numbers...

A path relinking approach for the generalized assignment problem (2002)

Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover

The generalized assignment problem is a classical combinatorial optimization problem known to be NP-hard. It can model a variety of real world applications in location, allocation, machine...

Greedy Splitting : A Unified Approach for Approximating Some Partition Problems (Mathematical Optimization Theory and its Algorithm) (2001)

Zhao, Liang, Nagamochi, Hiroshi, Ibaraki, Toshihide

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms) (2001)

Zhao, Liang, Nagamochi, Hiroshi, Ibaraki, Toshihide

A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs (New Developments of Theory of Computation and Algorithms) (2001)

Nagamochi, Hiroshi, Nishida, Yukihiro, Ibaraki, Toshihide

and (2001)

Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a...

Approximating the minimum k-way cut in a graph via minimum 3-way cuts (2001)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Abstract. For an edge weighted undirected graph G and an integer k ≥ 2, a k-way cut is a set of edges whose removal leaves G with at least k components. We propose a simple approximation algorithm...

Local Search Heuristics for the Rectangle Packing (2001)

Problem With General, Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki

this paper the rectangle packing problem in which each rectangle has a spatial cost (RPGSC). The problem is to pack a given set of n rectangles without overlap so that the maximum cost of the...

Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Window Constraints (2001)

Toshihide Ibaraki, Mikio Kubo, Tomoyasu Masuda, Takeaki Uno, Mutsunori Yagiura

On metaheuristic algorithms for combinatorial optimization problems (2001)

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

Abstract: Metaheuristic algorithms are widely recognized as one of the most practical approaches for combinatorial optimization problems. Among representative metaheuristics are genetic algorithm,...

Koji Nonobe, Toshihide Ibaraki

this paper, we introduce a time-lag cost, which is charged according to the di#erence of start times of the two activities specified, and consider the RCPSP to minimize convex time-lag costs...

Deduction and Abduction with Ordered Binary Decision Diagrams (Foundations of Computer Science) (2000)

Horiyama, Takashi, Ibaraki, Toshihide

Logical Analysis of Numerical Data (2000)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan

The "Logical Analysis of Data" (LAD) is a methodology developed since the late eightees, aimed at discovering hidden structural information in data sets. LAD was originally developed for...

Boolean Normal Forms, Shellability, And Reliability Computations (2000)

Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan

. Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive...

Variations on Extending Partially Defined Boolean Functions with Missing Bits (2000)

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

In this paper we consider four di#erent definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and...

An Implementation of Logical Analysis of Data (2000)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Er Kogan, Ieee Computer Society, ...

The paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for...

Finding Small Sets of Essential Attributes in Binary Data (2000)

Endre Boros, Endre Boros, Takashi Horiyama, Takashi Horiyama, Toshihide Ibaraki, Toshihide Ibaraki, ...

.We consider the problem of nding support sets (i.e., sets of essential attributes) in a given data set, which consists of n-dimensional binary vectors of positive examples and negative examples. A...

Logical Analysis of Numerical Data \Lambda (2000)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki

Kogan yx

Finding essential attributes from binary data (2000)

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

We consider data sets that consist of n-dimensional binary vectors representing positive and negative examples for some (possibly unknown) phenomenon. A subset S of the attributes (or variables) of...

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

Horiyama, Takashi, Ibaraki, Toshihide

An ejection chain approach for the generalized assignment problem (1999)

Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover

We propose a tabu search algorithm for the generalized assignment problem, which is one of the representative combinatorial optimization problems known to be NP-hard. The algorithm features an...

Faster algorithm for computing minimum 5-way and 6-way cuts (1999)

Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki

Abstract: For an edge-weighted graph G with n vertices and m edges, the minimum k-way cut problem is to nd a partition of the vertex set into k non-empty subsets so that the weight sum of edges...

Computing intersections of Horn theories for reasoning with models (1999)

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits (1999)

We consider computational issues when combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We present efficient...

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

. In this paper we consider four di#erent definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and...

Logical Analysis of Binary Data with Missing Bits (1999)

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino, F Where

We model a given pair of sets of positive and negative examples, each of which may contain missing components, as a partially defined Boolean function with missing bits (pBmb) ( T , F ), where T #...

A Variable Depth Search Algorithm for the Generalized Assignment Problem (1999)

Mutsunori Yagiura, Takashi Yamaguchi, Toshihide Ibaraki

: A variable depth search procedure (abbreviated as VDS) is a generalization of the local search method, which was rst successfully applied by Lin and Kernighan to the traveling salesman problem and...

Disjunction of Horn theories and their cores (1999)

Abtg Wissensbasierte Systeme, Kazuhisa Makino, Thomas Eiter, Thomas Eiter, Toshihide Ibaraki, Toshihide Ibaraki

. In this paper, we study issues on disjunctions of propositional Horn theories. In particular, we consider deciding whether a disjunction of Horn theories is Horn, and, if not, computing a Horn core...

Optimal Augmentation of a Submodular and Posi-modular Set Function by a Multigraph (1999)

Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki

Given a nite set V and a set function f : 2 7! Z, we consider the problem of constructing an undirected multigraph G = (V; E) such that the cut function c G : 2 7! Z of G and f together has value at...

Polyhedral Structure of Submodular and Posi-modular Systems (1998)

Nagamochi, Hiroshi, Ibaraki, Toshihide

Decision lists and related Boolean functions (1998)

Ibaraki, Toshihide, Eiter, Thomas, Makino, Kazuhisa

We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1decision lists has...

Computing intersections of Horn theories for reasoning with models (1998)

Ibaraki, Toshihide, Eiter, Thomas, Makino, Kazuhisa

Modelbased reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic...

Computing intersections of Horn theories for reasoning with models (1998)

Eiter, Thomas, Ibaraki, Toshihide, Makino, Kazuhisa

Modelbased reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic...

Decision lists and related Boolean functions (1998)

Eiter, Thomas, Ibaraki, Toshihide, Makino, Kazuhisa

We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1decision lists has...

Computing intersections of Horn theories for reasoning with models (1998)

Eiter, Thomas, Ibaraki, Toshihide, Makino, Kazuhisa

Decision lists and related Boolean functions (1998)

Eiter, Thomas, Ibaraki, Toshihide, Makino, Kazuhisa

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

Functional Dependencies in Horn Theories (1998)

Abstract. For problems SAT and MAX SAT, local search algorithms are widely acknowledged as one of the most eective approaches. Most of the local search algorithms are based on the 1- ip neighborhood,...

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is defined as the Horn envelope of a set of models. We provide...

Functional Dependencies in Horn Theories (1998)

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is defined as the Horn envelope of a set of models. We provide...

A Note on Minimizing Submodular Functions (1998)

An Approximation of the Minimum Vertex Cover in a Graph (1998)

For a given submodular function f on a nite set V , we consider the problem of nding a nonempty and proper subset X of V that minimizes f(X). If the function f is symmetric, then the problem can be...

Decision Lists and Related Boolean Functions (1998)

For a given undirected graph G with n vertices and m edges, we present an approximation algorithm for the minimum vertex cover problem. Our algorithm nds a vertex cover within 2 8m 13n 2 +8m of the...

Thomas Eiter, Thomas Eiter, Toshihide Ibaraki, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

. We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists has...

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

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki

In this paper we consider a single-vehicle scheduling problem on a straight line. Let L = (V; E) be a line, where V = fv 1 ; v 2 ; . . . ; v n g is a set of n vertices and E = ffv i ; v i+1 g j i =...

Computing Intersections Of Theories For Reasoning With Models (1998)

Thomas Eiter, Thomas Eiter, Toshihide Ibaraki, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

. Model-based reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic...

Decision lists and related boolean functions (1998)

Thomas Eiter, Thomas Eiter, Toshihide Ibaraki, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

Abstract. We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists...

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

Deng, Xiaotie, Ibaraki, Toshihide, Nagamochi, Hiroshi

Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions (1997)

Bioch, Jan C., Ibaraki, Toshihide, Makino, Kazuhisa

Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously (1997)

ISHII, Toshimasa, NAGAMOCHI, Hiroshi, IBARAKI, Toshihide

Optimization Games on Graphs(Continuous and Discrete Mathematical Optimization) (1997)

Deng, Xiaotie, Ibaraki, Toshihide, Nagamochi, Hiroshi

Tabu Search Approach to CSP (Constraint Satisfaction Problem) as a General Problem Solver(Continuous and Discrete Mathematical Optimization) (1997)

Nonobe, Koji, Ibaraki, Toshihide

Technical Report #97012 A (1997)

Hiroshi Nagamochi, Yoshitaka Nakao, Toshihide Ibaraki

Abstract This paper presents an algorithm for constructing a cactus representation for all minimum cuts in an undirected network. Our algorithm runs in O(nm + n 2 log n + flm log n) time, where n and...

Deterministic O(nm) Time Edge-Splitting in Undirected Graphs (1997)

Complexity of the Single Vehicle Scheduling Problem on Graphs (1997)

This paper presents a deterministic O(nm log n + n 2 log 2 n) = ~ O(nm) time algorithm for splitting o all edges incident to a vertex s of even degree in a multigraph G, where n and m are the numbers...

Hiroshi Nagamochi, Koji Mochizuki, Toshihide Ibaraki

: Let G = (V; E) be a graph. The travel times w(u; v) and w(v; u) are associated with each edge fu; vg 2 E, and a job, which is also denoted as v, is located at each node v 2 V . Each job v has...

Algorithms and Complexity in Combinatorial Optimization Games (1997)

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi

We introduce an integer programming formulation for a class of combinatorial optimization games, which includes many interesting problems on graphs. We prove a simple (but very useful) theorem that...

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

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

In this paper, we address a fundamental problem related to the induction of Boolean logic: Given a set of data, represented as a set of binary "true n-vectors" (or "positive...

Polynomial Time Recognition Of 2-Monotonic Positive Boolean Functions Given By An Oracle (1997)

Endre Boros Peter, Peter L. Hammer, Toshihide Ibaraki

. We consider the problem of identifying an unknown Boolean function f by asking an oracle the functional values f(a) for a selected set of test vectors a # {0, 1} n . Furthermore, we assume that f...

Logical Analysis of Numerical Data (1997)

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

.The "Logical Analysis of Data" (LAD) is a methodology developed since the late eightees, aimed at discovering hidden structural information in data sets. LAD was originally developed for...

An Implementation of Logical Analysis of Data (1996)

Boros, Endre, Hammer, Peter L., Ibaraki, Toshihide, Kogan, Alexander, Mayoraz, Eddy, Muchnik, Ilya

The paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for...

Vehicle scheduling on a tree to minimize maximum lateness (1996)

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki

Abstract In this paper we deal with a single-vehicle scheduling problem on a tree-shaped road network. Let T = (V, E) be a tree, where V is a set of n vertices and E is a set of edges. A task is...

Extensions of partially defined boolean functions with missing data (1996)

Endre Boros, Endre Boros, Toshihide Ibaraki, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

R u t c o r

Boolean Analysis of Incomplete Examples (1996)

Endre Boros Toshihide, Toshihide Ibaraki, Kazuhise Makino

As a form of knowledge acquisition from data, we consider the problem of deciding whether there exists an extension of a partially defined Boolean function with missing data ( T , F ), where T...

Boolean Analysis of Incomplete Examples (1996)

Endre Boros, Endre Boros, Toshihide Ibaraki, Toshihide Ibaraki, Kazuhisa Makino, Kazuhisa Makino

.As a form of knowledge acquisition from data, we consider the problem of deciding whether there exists an extension of a partially defined Boolean function with missing data ( ~ T ; ~ F ), where ~ T...

An Implementation of Logical Analysis of Data (1996)

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

. The paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for...

Genetic and Local Search Algorithms as Robust and Simple Optimization Tools (1996)

The Use of Dynamic Programming in Genetic Algorithms for Permutation Problems (1996)

: One of the attractive features of recent metaheuristics is in its robustness and simplicity. To investigate this direction, the single machine scheduling problem is solved by various genetic...

Metaheuristics as Robust and Simple Optimization Tools (1996)

To deal with computationally hard problems, approximate algorithms are used to provide reasonably good solutions in practical time. Genetic algorithms are an example of the meta-heuristics which were...

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

One of the attractive features of recent metaheuristics is in its robustness and simplicity. To investigate this direction, the single machine scheduling problem is solved by various metaheuristics,...