Knop, DušanDušanKnopKoutecký, MartinMartinKouteckýLevin, AsafAsafLevinMnich, MatthiasMatthiasMnichOnn, ShmuelShmuelOnn2021-11-292021-11-292021-11-15Operations Research Letters (2021)http://hdl.handle.net/11420/11096Configuration 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.en0167-637720216908913Elsevier Sciencehttps://creativecommons.org/licenses/by-nc-nd/4.0/Parameterized algorithmsConfigurationSurfingInformatikMathematikJournal Article10.15480/882.394210.1016/j.orl.2021.11.00510.15480/882.3942Journal Article