The complexity landscape of decompositional parameters for ILP

Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2018) The complexity landscape of decompositional parameters for ILP. Artificial Intelligence, 257. pp. 61-71. ISSN 0004-3702

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2018 Elsevier. This is an author produced version of a paper subsequently published in Artificial Intelligence. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords: Integer Linear Programming; Treewidth; Treedepth; (Parameterized) complexity
Dates:
  • Published: April 2018
  • Published (online): 8 January 2018
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: 09 May 2018 15:39
Last Modified: 08 Jan 2019 01:38
Published Version: https://doi.org/10.1016/j.artint.2017.12.006
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.artint.2017.12.006
Related URLs:

Download

Share / Export

Statistics