Pseudo-Boolean Programming

Peter L. Hammer and Sergiu Rudeanu
Additional contact information
Peter L. Hammer: Technion, Haifa, Israel
Sergiu Rudeanu: Romanian Academy, Bucharest, Romania

Operations Research, 1969, vol. 17, issue 2, 233-261

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 .

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.2.233 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:17:y:1969:i:2:p:233-261

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().