Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications
Daniel Scholz · 2011
Principals and basic concepts.- The geometric branch-and-bound algorithm.-Bounding operations.- Extension for multicriteria problems.- Multicriteria discarding tests.- Extension for mixed combinatorial problems.- The circle detection problem.- Integrated scheduling and location problems.- The median line problem.- Summary and discussion.- References.- Index.