An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs.
B. N. KhouryPanos M. PardalosPublished in: COCOON (1995)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- upper bound
- combinatorial optimization
- optimal solution
- search tree
- lower bounding
- np hard
- single machine scheduling problem
- upper bounding
- precedence constraints
- randomly generated problems
- graph matching
- exact methods
- graph theoretic
- lagrangian relaxation
- branch and bound method
- exact solution
- mixed integer linear programming
- graph theory
- variable ordering
- optimization problems
- finding an optimal solution
- max sat
- objective function
- particle swarm optimization
- search algorithm