Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.

Boris Goldengorin Diptesh Ghosh Gerard Sierksma

Published in: WAE (2001)

Keyphrases

branch and bound algorithm
lower bound
branch and bound
randomly generated
upper bound
search tree
optimal solution
boolean satisfiability
set covering problem
haplotype inference
finding an optimal solution
np hard
dynamic programming
combinatorial optimization