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 Thirty-Third AAAI Conference on Artificial Intelligence. Thirty-Third AAAI Conference on Artificial Intelligence, 27 Jan - 01 Feb 2019, Honolulu, Hawaii, USA. Association for the Advancement of Artificial Intelligence (AAAI) , pp. 1477-1484. ISBN 9781577358091
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: |
|
Copyright, Publisher and Additional Information: | © 2019 Association for the Advancement of Artificial Intelligence. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 18 Oct 2019 11:03 |
Last Modified: | 18 Oct 2019 11:03 |
Status: | Published |
Publisher: | Association for the Advancement of Artificial Intelligence (AAAI) |
Refereed: | Yes |
Identification Number: | 10.1609/aaai.v33i01.33011477 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:152338 |