The Expressive Power of Binary Linear Programming

  • Marco Cadoli
Conference paper

DOI: 10.1007/3-540-45578-7_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Marco Cadoli
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversitá di Roma “La Sapienza”RomaItaly

Personalised recommendations