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

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.