Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1648250,
author = {Eiben, Eduard and Ganian, Robert and Knop, Dusan and Ordyniak, Sebastian},
address = {USA},
booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
doi = {http://dx.doi.org/10.1609/aaai.v33i01.33011477},
editor = {Peter Stone},
keywords = {Parameterized Complexity},
howpublished = {elektronická verze "online"},
language = {eng},
location = {USA},
isbn = {978-1-57735-809-1},
pages = {1477-1484},
publisher = {AAAI Press},
title = {Solving Integer Quadratic Programming via Explicit and Structural Restrictions},
url = {https://aaai.org/ojs/index.php/AAAI/article/view/3960},
year = {2019}
}
TY - JOUR
ID - 1648250
AU - Eiben, Eduard - Ganian, Robert - Knop, Dusan - Ordyniak, Sebastian
PY - 2019
TI - Solving Integer Quadratic Programming via Explicit and Structural Restrictions
PB - AAAI Press
CY - USA
SN - 9781577358091
KW - Parameterized Complexity
UR - https://aaai.org/ojs/index.php/AAAI/article/view/3960
L2 - https://aaai.org/ojs/index.php/AAAI/article/view/3960
N2 - 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.
ER -
EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Online. In Peter Stone. \textit{Proceedings of the AAAI Conference on Artificial Intelligence}. USA: AAAI Press, 2019, s.~1477-1484. ISBN~978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33011477.
|
