Characterizing Feasible Pattern Sets with a Minimum Number of Breaks

Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui. Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. In Edmund K. Burke, Patrick De Causmaecker, editors, Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002, Selected Revised Papers. Volume 2740 of Lecture Notes in Computer Science, pages 78-99, Springer, 2002. [doi]

@inproceedings{MiyashiroIM02,
  title = {Characterizing Feasible Pattern Sets with a Minimum Number of Breaks},
  author = {Ryuhei Miyashiro and Hideya Iwasaki and Tomomi Matsui},
  year = {2002},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2740&spage=78},
  researchr = {https://researchr.org/publication/MiyashiroIM02},
  cites = {0},
  citedby = {0},
  pages = {78-99},
  booktitle = {Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002, Selected Revised Papers},
  editor = {Edmund K. Burke and Patrick De Causmaecker},
  volume = {2740},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40699-9},
}