01 Integer Linear Programming with a Linear Number of Constraints
Abstract
We give an exact algorithm for the 01 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem.
 Publication:

arXiv eprints
 Pub Date:
 January 2014
 arXiv:
 arXiv:1401.5512
 Bibcode:
 2014arXiv1401.5512I
 Keywords:

 Computer Science  Computational Complexity;
 Computer Science  Data Structures and Algorithms