Solving integer linear programs by exploiting variable-constraint interactions : a survey

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

Metadata

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:
  • Published (online): 22 November 2019
  • Published: 22 November 2019
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: 08 Jan 2020 10:31
Status: Published
Publisher: MDPI
Refereed: Yes
Identification Number: https://doi.org/10.3390/a12120248

Share / Export

Statistics