Paper Info
Title
Optimal constraints aggregation method for ILP
Abstract
In this paper we give a new aggregation method for Integer Linear Program (ILP), that allows to reduce the number of constraints of any ILP. In particular, we study the aggregation of non-negative systems of linear Diophantine equations. We prove that an aggregated system of minimum size can be constructed in polynomial time. We also study the minimum size of the coefficients of the aggregated problem.
Year
DOI
Venue
2019
10.1016/j.dam.2019.02.014
Discrete Applied Mathematics
Keywords
Field
DocType
Integer programming,Discrete geometry,Knapsack problem
Integer,Discrete mathematics,Linear programming,Time complexity,Diophantine equation,Mathematics
Journal
Volume
ISSN
Citations 
262
0166-218X
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Pierre-Louis Poirion1247.43