Efficiency comparison of exact and approximate algorithms for solving set covering problem
Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits. It defines relevance of searching methods to improve the solution efficiency of this task. Materials and Methods. Techniq...
Saved in:
| Main Authors: | Igor S. Konovalov, Sergey S. Ostapenko, Valery G. Kobak |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2017-10-01
|
| Series: | Advanced Engineering Research |
| Subjects: | |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/174 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Application of genetic algorithm for the set-covering problem solution
by: Igor S. Konovalov, et al.
Published: (2016-09-01) -
Applicability of elite samples in solving the traveling salesman problem by Goldberg model
by: Valery G. Kobak, et al.
Published: (2016-06-01) -
IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
Математическая модель оптимального раскроя профилей пластиковых окон
by: Вера Владимировна Журавлева, et al.
Published: (2025-04-01) -
Оптимизация параметров полиномиального рандомизированного алгоритма для асимметричной задачи коммивояжера
by: Максим Сергеевич Баркетов
Published: (2024-07-01)