Lower bound polynomial fast procedure for the Resource Constrained Project Scheduling Problem tested on PSPLIB instances - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

Lower bound polynomial fast procedure for the Resource Constrained Project Scheduling Problem tested on PSPLIB instances Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Конференция

The 9th International Conference on Analysis of Images, Social Networks and Texts
15-16 окт. 2020 , Moscow

Авторы

Goncharov E.N. ¹ , Gimadi E.Kh. ¹ , Stepa A.A. ²

Организации

1	Институт математики им. С.Л. Соболева СО РАН
2	Новосибирский государственный университет

https://link.springer.com/book/10.1007/978-3-030-72610-2

Goncharov E.N. , Gimadi E.K. , Stepa A.A.
Lower bound polynomial fast procedure for the Resource Constrained Project Scheduling Problem tested on PSPLIB instances
The 9th International Conference on Analysis of Images, Social Networks and Texts 15-16 Oct 2020