D 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions

EIBEN, Eduard; Robert GANIAN; Dusan KNOP and Sebastian ORDYNIAK

Basic information

Original name

Solving Integer Quadratic Programming via Explicit and Structural Restrictions

Authors

EIBEN, Eduard (703 Slovakia); Robert GANIAN (203 Czech Republic, guarantor, belonging to the institution); Dusan KNOP (203 Czech Republic) and Sebastian ORDYNIAK (276 Germany)

Edition

USA, Proceedings of the AAAI Conference on Artificial Intelligence, p. 1477-1484, 8 pp. 2019

Publisher

AAAI Press

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

is not subject to a state or trade secret

Publication form

electronic version available online

References:

RIV identification code

RIV/00216224:14330/19:00113718

Organization unit

Faculty of Informatics

ISBN

978-1-57735-809-1

ISSN

UT WoS

000485292601060

EID Scopus

2-s2.0-85090807031

Keywords in English

Parameterized Complexity
Changed: 14/5/2020 10:42, Mgr. Michal Petr

Abstract

In the original language

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.