We present a new approach to constrained quadratic binary programming. Dual bounds are computed by choosing appropriate global underestimators of the objective function that are separable but not necessarily convex. Using the binary constraint on the variables, the minimization of this separable underestimator can be reduced to a linear minimization problem over the same set of feasible vectors. For most combinatorial optimization problems, the linear version is considerably easier than the quadratic version. We explain how to embed this approach into a branch-and-bound algorithm and present experimental results for several classes of combinatorial optimization problems, including the quadratic shortest path problem, for which we provide the first exact approach available in the literature.
| Subject : | : | typdoc_1455 |
| Language of text | : | English |
| Topics | : | Non-linear optimisation, bi-level optimisation and yield management |
| Keywords | : | Binary Quadratic Optimization · Separable Underestimators · Quadratic Shortest Path Problem |
| PDF version | : |  PDF version |
