#### Filter Results:

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Roman Bazylevych, Marek Pałasiński, Lubov Bazylevych
- 2011

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)

The paper introduces foundations of the "Flexible Routing Method" that belongs to the topologically-geometric type. It develops the idea to divide the routing problem on two separate successive stages: topological and geometrical. At the first stage it was suggested to use a discrete topological model as Delaunay triangulation or/and Voronoi polygons to… (More)

- Roman Bazylevych, Marek Pałasiński, Roman Kutelmakh, Bohdan Kuz, Lubov Bazylevych
- 2012

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)

- Zoran Majkic, R. Radha, Michael Sipser, Daming Wei, Xiuyuan Yu, Zhonghua Shen +20 others
- 2011

Some format issues inherent in the e-media version may also appear in this print version.