A linear programming and constraint propagation-based lower bound for the RCPSP.
Peter BruckerSigrid KnustPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- constraint propagation
- lower bound
- linear programming
- resource constrained project scheduling problem
- resource constraints
- np hard
- temporal constraints
- optimal solution
- upper bound
- objective function
- constraint satisfaction problems
- branch and bound
- linear program
- lower and upper bounds
- branch and bound algorithm
- constraint programming
- feasible solution
- lagrangian relaxation
- constraint satisfaction
- worst case
- constrained problems
- integer programming
- dynamic programming
- harmony search
- temporal reasoning
- artificial bee colony
- multi objective
- arc consistency
- routing problem
- constraint graph
- quantifier elimination
- np complete
- knapsack problem
- path consistency
- swarm intelligence
- temporal information
- optimization problems
- search space
- search algorithm