L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is an adaptation of an algorithm proposed by Shot for non-linear… (More)

In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We… (More)

Many optimization problems have several equivalent mathematical models. It is often not apparent which of these models is most suitable for practical computation, in particular, when a certain… (More)

The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper, we present a formulation of the problem involving only… (More)

A subset A of the edge set of a graph G =(V, E) is called a clique partitioning of G is there is a partition of the node set V into disjoint sets WI,... ,W k such that each W, induces a clique, i.e.,… (More)