Publication details

Solving Integer Quadratic Programming via Explicit and Structural Restrictions


EIBEN Eduard GANIAN Robert KNOP Dusan ORDYNIAK Sebastian

Year of publication 2019
Type Article in Proceedings
Conference Proceedings of the AAAI Conference on Artificial Intelligence
MU Faculty or unit

Faculty of Informatics

Keywords Parameterized Complexity
Description We study the parameterized complexity of Integer Quadratic Programming under two kinds of restrictions: explicit restrictions on the domain or coefficients, and structural restrictions on variable interactions. We argue that both kinds of restrictions are necessary to achieve tractability for Integer Quadratic Programming, and obtain four new algorithms for the problem that are tuned to possible explicit restrictions of instances that we may wish to solve. The presented algorithms are exact, deterministic, and complemented by appropriate lower bounds.

You are running an old browser version. We recommend updating your browser to its latest version.

More info