0-1 Integer Linear Programming with a Linear Number of Constraints
Computational Complexity
2014-02-20 v2 Data Structures and Algorithms
Abstract
We give an exact algorithm for the 0-1 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 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.
Cite
@article{arxiv.1401.5512,
title = {0-1 Integer Linear Programming with a Linear Number of Constraints},
author = {Russell Impagliazzo and Shachar Lovett and Ramamohan Paturi and Stefan Schneider},
journal= {arXiv preprint arXiv:1401.5512},
year = {2014}
}