On an optimal constraint aggregation method for integer programming and on an analytic expression of the number of integer points in a polytope
From MaRDI portal
Publication:6274036
arXiv1605.08742MaRDI QIDQ6274036FDOQ6274036
Authors: Pierre-Louis Poirion, Vu Khac Ky, Leo Liberti 
Publication date: 27 May 2016
Abstract: In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number of solutions of the system when it is possible to aggregate the system into one equation.
This page was built for publication: On an optimal constraint aggregation method for integer programming and on an analytic expression of the number of integer points in a polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6274036)
