Parameterized complexity of configuration integer programs

Dušan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn

doi:10.1016/j.orl.2021.11.005

Parameterized complexity of configuration integer programs

Dušan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn

Data and Decision Sciences

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	908-913
Number of pages	6
Journal	Operations Research Letters
Volume	49
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2021.11.005
State	Published - Nov 2021

Keywords

Configuration IP
Parameterized algorithms
Surfing

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2021.11.005

Cite this

@article{9a362442dd9f4075a843d12eafa2aec0,

title = "Parameterized complexity of configuration integer programs",

abstract = "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.",

keywords = "Configuration IP, Parameterized algorithms, Surfing",

author = "Du{\v s}an Knop and Martin Kouteck{\'y} and Asaf Levin and Matthias Mnich and Shmuel Onn",

note = "Publisher Copyright: {\textcopyright} 2021 The Author(s)",

year = "2021",

month = nov,

doi = "10.1016/j.orl.2021.11.005",

language = "الإنجليزيّة",

volume = "49",

pages = "908--913",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Parameterized complexity of configuration integer programs

AU - Knop, Dušan

AU - Koutecký, Martin

AU - Levin, Asaf

AU - Mnich, Matthias

AU - Onn, Shmuel

PY - 2021/11

Y1 - 2021/11

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

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

KW - Configuration IP

KW - Parameterized algorithms

KW - Surfing

UR - http://www.scopus.com/inward/record.url?scp=85119252035&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2021.11.005

DO - 10.1016/j.orl.2021.11.005

M3 - مقالة

SN - 0167-6377

VL - 49

SP - 908

EP - 913

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

Parameterized complexity of configuration integer programs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this