Unary Integer Linear Programming with Structural Restrictions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10387259" target="_blank" >RIV/00216208:11320/18:10387259 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/18:00106814
Result on the web
<a href="https://doi.org/10.24963/ijcai.2018/179" target="_blank" >https://doi.org/10.24963/ijcai.2018/179</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.24963/ijcai.2018/179" target="_blank" >10.24963/ijcai.2018/179</a>
Alternative languages
Result language
angličtina
Original language name
Unary Integer Linear Programming with Structural Restrictions
Original language description
Recently a number of algorithmic results have appeared which show the tractability of Integer Linear Programming (ILP) instances under strong restrictions on variable domains and/or coefficients (AAAI 2016, AAAI 2017, IJCAI 2017). In this paper, we target ILPs where neither the variable domains nor the coefficients are restricted by a fixed constant or parameter; instead, we only require that our instances can be encoded in unary. We provide new algorithms and lower bounds for such ILPs by exploiting the structure of their variable interactions, represented as a graph. Our first set of results focuses on solving ILP instances through the use of a graph parameter called clique-width, which can be seen as an extension of treewidth which also captures well-structured dense graphs. In particular, we obtain a polynomial-time algorithm for instances of bounded clique-width whose domain and coefficients are polynomially bounded by the input size, and we complement this positive result by a number of algorithmic lower bounds. Afterwards, we turn our attention to ILPs with acyclic variable interactions. In this setting, we obtain a complexity map for the problem with respect to the graph representation used and restrictions on the encoding.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
ISBN
978-0-9992411-2-7
ISSN
—
e-ISSN
neuvedeno
Number of pages
7
Pages from-to
1284-1290
Publisher name
International Joint Conferences on Artificial Intelligence
Place of publication
Neuveden
Event location
Stockholm
Event date
Jul 13, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—