A branch and bound algorithm for a time-table problem

A branch and bound algorithm for a time-table problem

0.00 Avg rating0 Votes
Article ID: iaor20033157
Country: China
Volume: 11
Issue: 1
Start Page Number: 17
End Page Number: 22
Publication Date: Feb 2002
Journal: Operations Research and Management Science
Authors:
Keywords: programming: branch and bound, education
Abstract:

This paper studies the time-table problem for middle schools. A branch and bound algorithm is proposed. Our experiment results show that the proposed algorithm is both efficient and effective for this problem.

Reviews

Required fields are marked *. Your email address will not be published.