Concave Programming Applied to a Special Class of 0-1 Integer Programs

Fred Glover and D. Klingman
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
D. Klingman: University of Texas, Austin, Texas

Operations Research, 1973, vol. 21, issue 1, 135-140

Abstract: This paper connects some of the recent developments in concave and integer programming. In particular, it points out parallels between the work of Hoang Tui and R. D. Young. From these methods, a finite algorithm for solving a special class of 0-1 integer programs is developed. Our approach contrasts with an earlier extension of Tui's method due to M. Raghavachari and general “intersection” or “convexity” cut approaches.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.135 (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:21:y:1973:i:1:p:135-140

Access Statistics for this article

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