Parameterized complexity of configuration integer programs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437097" target="_blank" >RIV/00216208:11320/21:10437097 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/21:00353552
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3fo5nWd1NT" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3fo5nWd1NT</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.orl.2021.11.005" target="_blank" >10.1016/j.orl.2021.11.005</a>

Result language
angličtina
Original language name
Parameterized complexity of configuration integer programs
Original language description
Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact (exponential-time) algorithms for Configuration IP and matching hardness results. Second, we showcase the implications of these results to bin-packing and facility-location-like problems. (C) 2021 The Author(s). Published by Elsevier B.V.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)