The Expressive Power of Binary Linear Programming

  • Marco Cadoli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

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.

References

  1. 1.
    S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley Publ. Co., Reading, Massachussetts, 1995.MATHGoogle Scholar
  2. 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. 3.
    Robert Fourer, David M. Gay, and Brian W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing, 1993.Google Scholar
  4. 5.
    P. G. Kolaitis and C. H. Papadimitriou. Why not negation by fixpoint? J. of Computer and System Sciences, 43:125–144, 1991.MATHCrossRefMathSciNetGoogle Scholar
  5. 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

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