Computational aspects of a branch and bound algorithm for quadratic zero-one programming.
Panos M. PardalosGregory P. RodgersPublished in: Computing (1990)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- optimal solution
- np hard
- upper bound
- combinatorial optimization
- precedence constraints
- search tree
- test problems
- single machine scheduling problem
- lower bounding
- randomly generated problems
- objective function
- upper bounding
- lagrangian relaxation
- max sat
- variable ordering
- finding an optimal solution
- computational complexity
- branch and bound method
- pairwise
- lower and upper bounds
- search algorithm
- maximum clique
- integer variables