The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams

Publication Information

Title

Japanese:
English:	The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams

Author

Japanese:	宮代隆平, 松井知己.
English:	Ryuhei Miyashiro, Tomomi Matsui.

Language

English

Journal/Book name

Japanese:
English:	The 5th International Conference on the Practice and Theory of Automated Timetabling

Volume, Number, Page

pp. 535-538

Published date

Aug. 18, 2004

Publisher

Japanese:
English:

Conference name

Japanese:
English:	The 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT2004)

Conference site

Japanese:
English: