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 (2014) On the Path-Width of Integer Linear Programming At Fifth International Symposium on Games, Automata, Logics and Formal Verification (GandALF), Italy.

Record type: Conference or Workshop Item (Paper)


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 ILP-GANDALF14.pdf - Other
Download (231kB)

More information

Accepted/In Press date: September 2014
Venue - Dates: Fifth International Symposium on Games, Automata, Logics and Formal Verification (GandALF), Italy, 2014-09-01
Organisations: Electronic & Software Systems


Local EPrints ID: 351912
PURE UUID: 26dde00f-b87a-40ef-a14d-b61ba49d9003

Catalogue record

Date deposited: 25 Apr 2013 19:55
Last modified: 18 Jul 2017 04:21

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.