Technical Note—A Note on Zero-One Programming

Manfred W. Padberg
Additional contact information
Manfred W. Padberg: New York University, New York, New York

Operations Research, 1975, vol. 23, issue 4, 833-837

Abstract: We generalize a method for constructing facets for the convex hull of integer solutions to set packing problems to arbitrary zero-one problems having nonnegative constraint-matrices. A particular class of facets is obtained explicitly and illustrated by a numerical example.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.4.833 (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:23:y:1975:i:4:p:833-837

Access Statistics for this article

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