Concepedia

A branch-and-cut procedure for the Udine Course Timetabling problem

Edmund Burke, Jakub Mareček, Andrew J. Parkes, Hana Rudová

Annals of Operations Research · 2011 · 58 citations · 42 references

DOI

Concepts

References

42

Lecture Notes in Computer Science 1205

Industrial Robot the international journal of robotics research and application · 1999 · 38.7K citations

, , +2

Network Flows: Theory, Algorithms, and Applications.

David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text

, , +10

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

, , +8

An upper bound for the chromatic number of a graph and its application to timetabling problems

Dominic Welsh · The Computer Journal · 1967 · 764 citations · Full text

, , +12

The worst-case time complexity for generating all maximal cliques and computational experiments

Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi · Theoretical Computer Science · 2006 · 761 citations

, , +12