A Lagrangian relaxation approach to solve the second phase of the exam scheduling problem
- 31 March 1988
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 34 (3), 372-383
- https://doi.org/10.1016/0377-2217(88)90158-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A graph coloring algorithm for large scheduling problemsJournal of Research of the National Bureau of Standards, 1979
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Exact Implicit Enumeration Method for Solving the Set Partitioning ProblemIBM Journal of Research and Development, 1972
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Scheduling to reduce conflict in meetingsCommunications of the ACM, 1970
- Scheduling university course examinations by computerCommunications of the ACM, 1967
- Algorithm 286: Examination schedulingCommunications of the ACM, 1966
- Scheduling to Minimize Interaction CostOperations Research, 1966
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Final examination schedulingCommunications of the ACM, 1964