Technical Note—A Note on Zero-One Integer and Concave Programming

V. Joseph Bowman and Fred Glover
Additional contact information
V. Joseph Bowman: University of Pittsburgh and Carnegie-Mellon University, Pittsburgh, Pennsylvania
Fred Glover: University of Colorado, Boulder, Colorado

Operations Research, 1972, vol. 20, issue 1, 182-183

Abstract: It has been shown that the zero-one linear integer programming problem can be formulated as a minimization of a concave quadratic objective function subject to linear constraints. This note extends the concept to a broad class of concave objective functions.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.182 (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:20:y:1972:i:1:p:182-183

Access Statistics for this article

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