Parameterized complexity of configuration integer programs

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 an...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 49; číslo 6; s. 908 - 913
Hlavní autori: Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.11.2021
Predmet:
Configuration IP
Parameterized algorithms
Surfing
Configuration IP
Parameterized algorithms
Surfing
ISSN:0167-6377, 1872-7468
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2021.11.005