Алгоритм допусков для решения задач комбинаторной оптимизации (ЗКО)
The paper considers using tolerance theory for solving combinatorial optimization problems. As a result initial problem solving converts to solving a set of special problem with special data structure. The tolerance theory and data correction are used in new algorithm for solving an assignment probl...
Saved in:
| Published in: | Теорія оптимальних рішень |
|---|---|
| Date: | 2006 |
| Main Authors: | , , |
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2006
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/84960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Алгоритм допусков для решения задач комбинаторной оптимизации (ЗКО) / В.В. Бойко, Б.И. Гольденгорин, В.Н. Кузьменко // Теорія оптимальних рішень: Зб. наук. пр. — 2006. — № 5. — С. 99-105. — Бібліогр.: 7 назв. — рос. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | The paper considers using tolerance theory for solving combinatorial optimization problems. As a result initial problem solving converts to solving a set of special problem with special data structure. The tolerance theory and data correction are used in new algorithm for solving an assignment problem. The results of computational experiments are given in comparison with results of the best methods.
|
|---|---|
| ISSN: | XXXX-0013 |