An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration

From MaRDI portal
Publication:319357


DOI10.1016/j.ejor.2014.12.037zbMath1346.90375MaRDI QIDQ319357

Aziz Moukrim, Hélène Toussaint, Alain Quilliot

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.037


90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research


Related Items


Uses Software


Cites Work