A branch-and-bound algorithm for the acyclic partitioning problem.
Jenny NossackErwin PeschPublished in: Comput. Oper. Res. (2014)
Keyphrases
- branch and bound algorithm
- np hard
- lower bound
- branch and bound
- randomly generated
- optimal solution
- search tree
- test problems
- upper bound
- precedence constraints
- lower bounding
- combinatorial optimization
- special case
- mixed integer linear programming
- scheduling problem
- approximation algorithms
- np complete
- max sat
- single machine scheduling problem
- lagrangian relaxation
- upper bounding
- knapsack problem
- linear programming
- integer programming
- randomly generated problems
- linear program
- constraint satisfaction problems
- maximum clique
- finding an optimal solution
- integer variables
- particle swarm optimization
- optimization problems
- computational complexity