A Branch-and-Bound Algorithm for Finding All Optimal Solutions of the Assignment Problem.
Zhuo FuRichard W. EgleseMichael B. WrightPublished in: Asia Pac. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- optimal solution
- np hard
- branch and bound
- lower bound
- maximum clique
- test problems
- upper bound
- lower bounding
- lagrangian relaxation
- precedence constraints
- linear programming
- randomly generated problems
- single machine scheduling problem
- variable ordering
- knapsack problem
- objective function
- dominance rules
- combinatorial optimization
- linear program
- search space
- search algorithm
- upper bounding
- max sat
- metaheuristic
- mixed integer linear programming
- branch and bound method
- neural network
- integer programming
- feasible solution
- evolutionary algorithm
- finding an optimal solution