A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming.
Gintaras PalubeckisPublished in: Computing (1995)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- np hard
- randomly generated
- upper bound
- optimal solution
- test problems
- lower bounding
- combinatorial optimization
- precedence constraints
- randomly generated problems
- objective function
- upper bounding
- single machine scheduling problem
- mixed integer linear programming
- search tree
- max sat
- computational complexity
- lagrangian relaxation
- variable ordering
- maximum clique
- column generation
- search space
- pairwise
- search algorithm
- genetic algorithm
- traveling salesman problem
- metaheuristic
- branch and bound method
- finding an optimal solution