Eiben, E, Ganian, R, Knop, D et al. (1 more author) (2019) Solving Integer Quadratic Programming via Explicit and Structural Restrictions. In: Proceedings of the AAAI Conference on Artificial Intelligence. The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 27 Jan - 01 Feb 2019, Honolulu, Hawaii USA. PKP Publishing Services Network , pp. 1477-1484.
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.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 Nov 2020 14:30 |
Last Modified: | 17 Nov 2020 14:30 |
Status: | Published |
Publisher: | PKP Publishing Services Network |
Identification Number: | 10.1609/aaai.v33i01.33011477 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:168078 |