Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2019) Solving integer linear programs by exploiting variable-constraint interactions : a survey. Algorithms, 12 (12). 248. ISSN 1999-4893
Abstract
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complexity of ILP through the lens of variable-constraint interactions. This changed drastically in recent years thanks to a series of results that together lay out a detailed complexity landscape for the problem centered around the structure of graphical representations of instances. The aim of this survey is to summarize these recent developments, put them into context and a unified format, and make them more approachable for experts from many diverse backgrounds.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
Keywords: | integer linear programming; parameterized complexity; treewidth; treedepth |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 08 Jan 2020 10:31 |
Last Modified: | 25 Jun 2023 22:05 |
Status: | Published |
Publisher: | MDPI |
Refereed: | Yes |
Identification Number: | 10.3390/a12120248 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:154134 |