Author:
Di Gaspero Luca,Gärtner Johannes,Kortsarz Guy,Musliu Nysret,Schaerf Andrea,Slany Wolfgang
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference27 articles.
1. Aarts, E., & Lenstra, J. K. (Eds.). (1997). Local search in combinatorial optimization. New York: Wiley.
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows, Englewood Cliffs: Prentice-Hall.
3. Balakrishnan, N., & Wong, R. T. (1990). A network model for the rotating workforce scheduling problem. Networks, 20, 25–42.
4. Bar-Ilan, J., Kortsarz, G., & Peleg, D. (2001). Generalized submodular cover problems and applications. Theoretical Computer Science, 250(12), 179–200.
5. Bartholdi, J., Orlin, J., & Ratliff, H. (1980). Cyclic scheduling via integer programs with circular ones. Operations Research, 28, 110–118.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献