Abstract
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.
Cite
CITATION STYLE
Eiben, E., Ganian, R., Knop, D., & Ordyniak, S. (2019). Solving integer quadratic programming via explicit and structural restrictions. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 1477–1484). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33011477
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
