|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
A Graphical Algorithm for Solving an Investment Optimization Problemдоклад на конференции
- Авторы: Гафаров Е.Р., Werner F., Лазарев А.А., Долгий А.Б.
- Международная Конференция : 6th Multidisciplinary International Scheduling Conference: Theory & Applications (MISTA 2013)
- Даты проведения конференции: 2013
- Тип доклада: не указан
- Докладчик: не указан
- Место проведения: Gent, Belgium, Belgium
-
Аннотация доклада:
In this paper, a graphical algorithm (GrA) is presented for an investment optimization problem. This algorithm is based on the same Bellman equations as the best known dynamic programming algorithm (DPA) for the problem but the GrA has several advantages in comparison with the DPA. Based on this GrA, a fully-polynomial time approximation scheme is proposed having the best known running time. The idea of the GrA presented can also be used to solve some similar scheduling or lot-sizing problems in a more effective way.
- Добавил в систему: Лазарев Александр Алексеевич