Solving Integer Quadratic Programming via Explicit and Structural Restrictions. / Eiben, Eduard; Ganian, Robert; Knop, Dusan; Ordyniak, Sebastian.

2019. 1477-1484 Paper presented at The Thirty-Third AAAI Conference on Artificial Intelligence, Honolulu, United States.

Research output: Contribution to conferencePaper

Published

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.
Original languageEnglish
Pages1477-1484
Number of pages8
DOIs
Publication statusPublished - 17 Jul 2019
EventThe Thirty-Third AAAI Conference on Artificial Intelligence - Honolulu, United States
Duration: 27 Jan 20191 Feb 2019
https://aaai.org/Conferences/AAAI-19/

Conference

ConferenceThe Thirty-Third AAAI Conference on Artificial Intelligence
Abbreviated titleAAAI 2019
CountryUnited States
CityHonolulu
Period27/01/191/02/19
Internet address
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 34924551