Lower bound polynomial fast procedure for the Resource Constrained Project Scheduling Problem tested on PSPLIB instances - Conference attendances

Lower bound polynomial fast procedure for the Resource Constrained Project Scheduling Problem tested on PSPLIB instances Conference attendances

Language

Английский

Participant type

Секционный

Conference

The 9th International Conference on Analysis of Images, Social Networks and Texts
15-16 Oct 2020 , Moscow

Authors

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

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

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