作者: Anita Schobel , Daniel Scholz
DOI:
关键词:
摘要: 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 bounds use. In