Circular 1's and Cyclic Staffing.
Abstract
A commonly encountered integer linear program, basic to cyclic staffing and scheduling, has a constraint matrix possessing the property of circular 1's in columns. In general, such a matrix is not unimodular, balanced, or perfect. Nevertheless, many such problems may be efficiently solved for integer answers. A change of variable transforms them to comfortably finite and reassuringly predictable series of minimum cost network flow problems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1977
- Accession Number
- ADA046316
Entities
People
- H. Donald Ratliff
- James B. Orlin
- John J. Bartholdi Iii
Organizations
- University of Florida