Author:
Di Gasperol Luca,Gärtner Johannes,Kortsarz Guy,Musliu Nysret,Schaerf Andrea,Slany Wolfgang
Reference18 articles.
1. N. Balakrishnan and R.T. Wong. A network model for the rotating workforce scheduling problem. Networks, 20:25–42, 1990.
2. J. Bartholdi, J. Orlin, and H. Ratliff. Cyclic scheduling via integer programs with circular ones. Operations Research, 28:110–118, 1980.
3. M. R. Garey and D. S. Johnson. Computers and Intractability-A guide to NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
4. Lecture Notes in Computer Science;L. Gaspero Di,2003
5. Lecture Notes in Computer Science;L. Gaspero Di,2003