The University of Southampton
University of Southampton Institutional Repository

On the path-width of integer linear programming

Enea, Constantin, Habermehl, Peter, Inverso, Omar and Parlato, Gennaro (2017) On the path-width of integer linear programming Information and Computation, pp. 257-271. (doi:10.1016/j.ic.2016.07.010).

Record type: Article


We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution, there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path-width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary storage. We also show how this new result links to automata theory and program verification.

PDF final.pdf - Accepted Manuscript
Download (203kB)

More information

Accepted/In Press date: 2 June 2016
e-pub ahead of print date: 29 July 2016
Published date: 1 April 2017
Organisations: Electronic & Software Systems


Local EPrints ID: 386737
ISSN: 0890-5401
PURE UUID: 174e927a-04a5-4f07-b2a4-a4842c4c41d1

Catalogue record

Date deposited: 30 Jan 2016 22:58
Last modified: 29 Jul 2017 04:01

Export record



Author: Constantin Enea
Author: Peter Habermehl
Author: Omar Inverso
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.