Solving Integer Quadratic Programming via Explicit and Structural Restrictions

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F19%3A00325188" target="_blank" >RIV/68407700:21240/19:00325188 - isvavai.cz</a>

Alternative codes found

RIV/00216224:14330/19:00113718

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Solving Integer Quadratic Programming via Explicit and Structural Restrictions

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence

ISBN

978-1-57735-809-1

ISSN

2159-5399

e-ISSN

—

Number of pages

8

Pages from-to

1477-1484

Publisher name

AAAI Press

Place of publication

Menlo Park, California

Event location

Honolulu

Event date

Jan 27, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—