Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
Year of publication: |
2018
|
---|---|
Authors: | Fouilhoux, Pierre ; Mahjoub, Ali Ridha ; Quilliot, Alain ; Toussaint, Hélène |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 52.2018, 2, p. 513-528
|
Subject: | Resource-constrained precedence scheduling problem | Preemptive case | Antichain | Branch-and-Cut-and-Price algorithm | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory |
-
Network design with service requirements : scaling-up the size of solvable problems
Gudapati, Naga V. C., (2022)
-
Moukrim, Aziz, (2015)
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
- More ...
-
Barahona, Francisco, (1983)
-
Nonrobust strong knapsack cuts for capacitated location routing and related problems
Liguori, Pedro Henrique, (2023)
-
Design of survivable networks with low connectivity requirements
Almathkour, Fatmah, (2025)
- More ...