Unnetworks, with Applications to Idle Time Scheduling.
Abstract
The Dormouse celebrated its unbirthday 364 days of the year. Accordingly, this class of integer linear programs might be called unnetworks. They are interesting and efficiently solvable because of what is not there. Applications to idle time scheduling are discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1977
- Accession Number
- ADA039840
Entities
People
- H. Donald Ratliff
- John J. Bartholdi Iii
Organizations
- University of Florida