The complexity landscape of decompositional parameters for ILP : programs with few global variables and constraints

Dvořák, P., Eiben, E., Ganian, R. et al. (2 more authors) (2021) The complexity landscape of decompositional parameters for ILP : programs with few global variables and constraints. Artificial Intelligence, 300. 103561. ISSN 0004-3702

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Keywords: Integer linear programming; Parameterized complexity
Dates:
  • Accepted: 20 July 2021
  • Published (online): 28 July 2021
  • Published: November 2021
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: 21 Oct 2021 06:36
Last Modified: 21 Oct 2021 06:36
Status: Published
Publisher: Elsevier BV
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.artint.2021.103561

Share / Export

Statistics