Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes.
Janniele A. S. AraujoHaroldo Gambini SantosBernard GendronSanjay Dominik JenaSamuel S. BritoDanilo S. SouzaPublished in: CoRR (2019)
Keyphrases
- cutting plane
- preprocessing
- lower bound
- cutting plane algorithm
- upper bound
- integer programming
- integer programming problems
- column generation
- lower and upper bounds
- dantzig wolfe decomposition
- knapsack problem
- worst case
- integer program
- valid inequalities
- multistage stochastic
- linear programming relaxation
- optimal solution
- branch and bound
- constraint programming
- linear programming
- simulated annealing
- mixed integer
- np hard
- feature extraction