A Lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows.
Dhananjay R. ThiruvadyMark WallaceHanyu GuAndreas SchuttPublished in: J. Heuristics (2014)
Keyphrases
- lagrangian relaxation
- dynamic programming
- integer programming
- column generation
- feasible solution
- lower bound
- ant colony optimization
- np hard
- branch and bound algorithm
- lower and upper bounds
- linear programming
- mixed integer programming
- dual decomposition
- capacity constraints
- relaxation algorithm
- metaheuristic
- lagrangian heuristic
- markov decision processes
- state space
- infinite horizon
- network design problem
- single machine scheduling problem
- mixed integer program
- branch and bound
- cutting plane algorithm
- upper bound
- shortest path
- optimal policy
- linear program
- traveling salesman problem
- constraint satisfaction problems
- constraint satisfaction
- combinatorial optimization
- search space
- lagrangian dual
- mixed integer linear programs
- machine learning