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.

Download

[img] PDF ILP-GANDALF14.pdf - Other
Download (231kB)

Description/Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: Fifth International Symposium on Games, Automata, Logics and Formal Verification (GandALF), Italy, 2014-09-01
Organisations: Electronic & Software Systems
ePrint ID: 351912
Date :
Date Event
September 2014Accepted/In Press
Date Deposited: 25 Apr 2013 19:55
Last Modified: 23 Feb 2017 03:50
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/351912

Actions (login required)

View Item View Item