Lubov Bazylevych

Learn More
The paper summarizes the authors methodology for solving the intractable combinatorial problems in physical design of electronic devices: VLSI, SOC, PCB and other. The Optimal Circuit Reduction (OCR) method has proved to be an efficient and effective tool to identify the hierarchical clusters' circuit structure. The authors review the applicability of this(More)
This paper presents a decomposition algorithm for solving the uniform Travelling Salesman Problem (TSP). The algorithm assumes that the initial set of points is divided into subsets and overlapping regions between these subsets. The algorithm starts by considering a subset and find the solution in that subset. The solution in the next subset is calculated(More)
A parallel approach for solving a large-scale Euclidean Traveling Salesman Problem (TSP) is presented. The approach consists of the following stages: partitioning the input data set into clusters, solving the TSP for each cluster to get partial solutions, merging the partial solutions to form a complete solution, and optimizing the complete solution.(More)
Decomposition methods for solving large-scale Traveling Salesman Problem (TSP) are presented. Three approaches are proposed: macromodeling for clustered TSP as well as extending and " ring " methods for arbitrary points' distribution. Four stages of the problem solving include partitioning of the input set of points into small subsets, finding the partial(More)