|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational Resultsтезисы доклада
- Авторы: Лазарев А.А., Гафаров Е.Р., Werner F.
- Сборник: Proceedings of the 14th Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest, Romania)
- Тезисы
- Год издания: 2012
- Место издания: Bucharest
- Первая страница: 403
- Последняя страница: 408
- Аннотация: In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For some single machine scheduling problems, it is shown that the time complexity of the GrAis less than the time complexity of the standard DPA. Moreover, the average running time of the GrAis often essentially smaller. A GrAcan also solve large-scale instances and instances, where the parameters are not integer. For some problems,GrAhas a polynomial time complexity in contrast to a pseudo-polynomial complexity of aDPA.
- Добавил в систему: Лазарев Александр Алексеевич