Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes.
Janniele A. S. AraujoHaroldo G. SantosBernard GendronSanjay Dominik JenaSamuel S. BritoDanilo S. SouzaPublished in: Comput. Oper. Res. (2020)
Keyphrases
- cutting plane
- preprocessing
- lower bound
- upper bound
- cutting plane algorithm
- integer programming problems
- integer programming
- mixed integer
- column generation
- multistage stochastic
- lower and upper bounds
- valid inequalities
- integer program
- worst case
- branch and bound
- feature extraction
- dantzig wolfe decomposition
- knapsack problem
- optimal solution
- constraint programming
- particle swarm optimization
- computational complexity
- learning algorithm