A general solution algorithm for mixed continuous and combinatorial optimization problems
Anita Schöbel, Daniel Scholz · 2010
Geometric branch-and-bound techniques are popular solution algorithms for non-convex global optimization problems. Although several quite similar approaches can be found in the literature, they dier in the bounds they use. In