Minimization of Linear Pseudo-Boolean Functions

  • Peter L. Hammer
  • Sergiu Rudeanu
Part of the Ökonometrie und Unternehmensforschung / Econometrics and Operations Research book series (ÖKONOMETRIE, volume 7)

Abstract

The results of the preceding two chapters will now be used in order to solve pseudo-Boolean programs, that is problems of minimizing (maximizing) pseudo-Boolean functions with variables possibly subject to pseudo-Boolean constraints.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. As it was shown by R. Fortet [1], any pseudo-Boolean program may be reduced to a program of this type, by introduction of certain supplementary variables (see Theorem IV. 4).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1968

Authors and Affiliations

  • Peter L. Hammer
    • 1
  • Sergiu Rudeanu
    • 2
  1. 1.Department of Industrial and Management EngineeringTECHNION-Israel Institute of TechnologyHaifaIsrael
  2. 2.Institute of MathematicsAcademy of S. R. RoumaniaBucharestRomania

Personalised recommendations