Set Covering Applied to a Class of Binary Decision Problems.
Abstract
The paper is concerned with a solution technique for 0-1 integer programs with positive costs and nonnegative coefficient matrices. An algorithm is developed for this class of problems which involves solving a sequence of weighted set covering problems. The algorithm is then adapted to solve the fixed charge network flow problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1971
- Accession Number
- AD0731786
Entities
People
- H. Donald Ratliff
Organizations
- University of Florida