Login / Signup
An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration.
Aziz Moukrim
Alain Quilliot
Hélène Toussaint
Published in:
Eur. J. Oper. Res. (2015)
Keyphrases
</>
dynamic programming
learning algorithm
search space
np hard
cost function
optimization algorithm
neural network
resource constrained project scheduling problem
simulated annealing
ant colony optimization
optimization method
knapsack problem