The Expressive Power of Binary Linear Programming
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.
KeywordsInteger Linear Program Constraint Programming Expressive Power Relational Symbol Integer Linear Program Model
Unable to display preview. Download preview PDF.
- 2.R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pages 43–74. AMS, 1974.Google Scholar
- 3.Robert Fourer, David M. Gay, and Brian W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing, 1993.Google Scholar
- 6.Philippe Refalo. Linear formulation of constraint programming models and hybrid solvers. In Proc. of CP 2000, LNCS, pages 369–383. Springer-Verlag, 2000.Google Scholar