The Expressive Power of Binary Linear Programming
- First Online:
- Cite this paper as:
- Cadoli M. (2001) The Expressive Power of Binary Linear Programming. In: Walsh T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg
Very efficient solvers for Integer Programming exist, when the constraints and the objective function are linear. In this paper we tackle a fundamental question: what is the expressive power of Integer Linear Programming? We are able to prove that ILP, more precisely Binary LP, expresses the complexity class NP. As a consequence, in principle all specifications of combinatorial problems in NP formulated in constraint languages can be translated as BLP models.
Unable to display preview. Download preview PDF.