IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v17y1969i2p233-261.html
   My bibliography  Save this article

Pseudo-Boolean Programming

Author

Listed:
  • Peter L. Hammer

    (Technion, Haifa, Israel)

  • Sergiu Rudeanu

    (Romanian Academy, Bucharest, Romania)

Abstract

Many a problem in combinatorial operations research (including, in particular, linear and nonlinear integer programming), can be formulated with the aid of real-valued functions with bivalent (0, 1) variables. This paper surveys the methods originated and developed by the authors for solving such problems. The procedures are presented here in an improved version; the most important improvements refer to linear bivalent programming, to the determination of the “basic solutions,” etc. No proofs are given; for these as well as for various applications, the reader is referred to the authors' Boolean Methods in Operations Research and Related Areas .

Suggested Citation

  • Peter L. Hammer & Sergiu Rudeanu, 1969. "Pseudo-Boolean Programming," Operations Research, INFORMS, vol. 17(2), pages 233-261, April.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:2:p:233-261
    DOI: 10.1287/opre.17.2.233
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.2.233
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.2.233?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:17:y:1969:i:2:p:233-261. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.