We consider partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane. These algorithms subdivide the set of cities into small groups, ...

The cooperation is focused on deriving specifications for solving next-generation graph partitioning problems and evaluating current and future graph-partitioning algorithms implemented in QCI’s ...

The purpose of this study is to present a new classification procedure, Recursive Partitioning Algorithm (RPA), for financial analysis and to compare it with discriminant analysis within the context ...