Options
Parameterized complexity of configuration integer programs
Citation Link: https://doi.org/10.15480/882.3942
Publikationstyp
Journal Article
Date Issued
2021-11-15
Sprache
English
Institut
TORE-DOI
Journal
Volume
49
Issue
6
Start Page
908
End Page
913
Citation
Operations Research Letters (2021)
Publisher DOI
Scopus ID
Publisher
Elsevier Science
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.
Subjects
Parameterized algorithms
Configuration
Surfing
DDC Class
004: Informatik
510: Mathematik
Publication version
publishedVersion
Loading...
Name
1-s2.0-S0167637721001565-main.pdf
Size
354.71 KB
Format
Adobe PDF