Search academic texts

Information × Registration Number 0210U005384, 0108U005037 , R & D reports Title Intarctable combinatorial problems of large and very large sizes popup.stage_title Head Bazylevych Roman Pertrovych, Registration Date 18-11-2010 Organization Lviv Polytechnic National University popup.description2 The object of research: combinatorial problems of high and very high sizes. Objective: To develop methodology and algorithms for solving combinatorial intactable problems of high and very high sizes. Method of study: decomposition and clustering. Most of the applications related to combinatorial problems have higher computational complexity than polynomial - exponential, factorial and even more difficult. In the case of high dimension - already higher than 1000 items - unsuitable for such problems is the existing classical methods of solving them, and metaeuristic - the method of branches and boundaries, the method of simulation annealing, tabu search, genetic, neural networks and heuristic algorithms. To find their solutions decomposition is necessary. Its quality depends largely on the quality of final solutions. Therefore, in the considerable attention paid to developing effective methods and software system for partitioning complex circuits with providing the necessary quality. Since most of the applications (scheduling, an optimal route, design of electronic equipment for a large degree of integration) are reduced to the problem of TSP, the analysis of existing approaches to solving this class of problems, noted the advantages and disadvantages. Product Description popup.authors Базилевич Роман Петрович Влах Михайло Іванович Кутельмах Роман Корнелійович Пелех Назар Іванович popup.nrat_date 2020-04-02 Close