Solving Integer Quadratic Programming via Explicit and Structural Restrictions.
Lists
Only you see this
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.
BibTeX
@inproceedings{eiben2019solving,
author = {Eduard Eiben and Robert Ganian and Dusan Knop and Sebastian Ordyniak},
title = {{Solving Integer Quadratic Programming via Explicit and Structural Restrictions.}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
doi = {10.1609/aaai.v33i01.33011477},
}Loading related content...