Author:
Koster A. M. C. A.,Scheidweiler R.,Tieves M.
Funder
Seed Fund RWTH Aachen Excellence Initiative
German Federal Ministry of Education and Research
Undergraduate Funds of the Excellence Initiative
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference16 articles.
1. Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River, NJ: Prentice-Hall, Inc.
2. Brélaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251–256.
3. de Werra, D. (1997). Restricted coloring models for timetabling. Discrete Mathematics, 165, 161–170.
4. de Werra, D. (1999). On a multiconstrained model for chromatic scheduling. Discrete Applied Mathematics, 94(1), 171–180.
5. Goldberg, A. V. (1985). A new max-flow algorithm, Technical Report MIT/LCS/TM-291. Laboratory for Computer Science, Massachusetts Institute of Technology.