|
|||||
|
|
A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables |
|
| Authors: | Anita Schöbel Daniel Scholz |
| Institution: | Institut für Numerische und Angewandte Mathematik, Georg-August-Universität Göttingen, Germany |
| Abstract: | Geometric branch-and-bound techniques are well-known solution algorithms for non-convex continuous global optimization problems with box constraints. Several approaches can be found in the literature differing mainly in the bounds used. |
| Keywords: | Global optimization Combinatorial optimization Non-convex optimization Mixed-integer optimization Branch-and-bound methods Facility location problems |
| 本文献已被 ScienceDirect 等数据库收录！ | |