On the path-width of integer linear programming
Enea, Constantin, Habermehl, Peter, Inverso, Omar and Parlato, Gennaro (2016) On the path-width of integer linear programming Information and Computation, pp. 1-15. (doi:10.1016/j.ic.2016.07.010).
- Accepted Manuscript
Restricted to Repository staff only until 29 July 2017.
Available under License Creative Commons Attribution Non-commercial No Derivatives.
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.
|Digital Object Identifier (DOI):||doi:10.1016/j.ic.2016.07.010|
|Organisations:||Electronic & Software Systems|
|Date Deposited:||30 Jan 2016 22:58|
|Last Modified:||22 Feb 2017 06:47|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)