The Expressive Power of Binary Linear Programming

Authors:
Marco Cadoli
Affiliations:
-
Venue:
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Year:
2001

Citing 3
Cited 0

Why not negation by fixpoint?

Journal of Computer and System Sciences
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Linear Formulation of Constraint Programming Models and Hybrid Solvers

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.