Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds.
Alf KimmsPublished in: Ann. Oper. Res. (2001)
Keyphrases
- lagrangian relaxation
- resource constraints
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- resource constrained
- randomly generated test problems
- worst case
- branch and bound
- dual decomposition
- mixed integer programming
- optimal solution
- routing problem
- mixed integer program
- np hard
- resource constrained project scheduling problem
- temporal constraints
- resource availability
- linear programming relaxation
- objective function
- setup times
- single machine scheduling problem
- feasible solution
- integer programming
- dynamic programming
- lagrangian heuristic
- cutting plane
- temporal reasoning
- neural network