Computer science and information technologies = Комп'ютерні науки та інформаційні технології (CSIT’2006) – 2006 р.

Permanent URI for this collectionhttps://ena.lpnu.ua/handle/ntb/22502

First International Conference on Computer Scince and Information Technologies (CSIT'2006) for scientists, experts, graduates and undergraduates.

Computer science and information technologies : proceedings of the international conference (September 28th-30th, Lviv, Ukraine) / Ministry of Education and Science of Ukraine, Lviv Polytechnic National University, Institute of Computer Science and Information Technologies. – Lviv, 2006. – 202 p.

Browse

Filters

20062

Settings

Author: search.filters.author.Bazylevych, R.Start date: 2006

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Mechanism sequential access of parts of decomposition on the basis of the technique of optimal circuit reduction
    (Українські технології, 2006) Bazylevych, R.; Hudz, I.
    There were considered the peculiarities of programmatic realization of mechanism sequential access of parts of decomposition of complex circuit. There were revealed main approaches of carrying out of starting optimization of sequential parts of decomposition.
  • Thumbnail Image
    Item
    Scanning-area algorithms for clustered TSP
    (Українські технології, 2006) Bazylevych, R.; Dupas, R.; Kutelmakh, R.
    One of the base problems of combinatorial optimization, that has wide applications, is the Traveling Salesman Problem (TSP). Rapid growth of its size (thousands of points) is the main feature now, and many extensions of this problem with specific properties are studied: dynamic vehicle routing problems; systems with call (the first-aid, the courier's, the taxi), systems with time windows, and systems of delivery. They need development of the special algorithms, which provide high-quality solutions in reasonable time. That is why subsequent perfection of existing algorithms and development of new ones is relevant. In this paper, a set of strategies were proposed and evaluated, in order to solve specific TSP problems in which the points are under the form of clusters.