Next: About this document
Up: No Title
Previous: Acknowledgments
References
- 1
-
Aarts, E. H, J. Korst, and P. J. van Laarhoven, ``Simulated
annealing,'' in Local Search in Combinatorial Optimization,
E. H. Aarts and J. K. Lenstra (eds.), John Wiley and Sons. (to
appear in 1997)
- 2
-
Abramson, D,
``Constructing school timetables using simulated annealing:
sequential and parallel algorithms,'' Management Science, 37(1), 98-113,
1991.
- 3
-
Abramson, D., H. Dang, and M. Krishnamoorthy,
``An Empirical Study of Simulated Annealing Cooling Schedules,''
Griffith Univ. report, Nathan, Qld, Aus. 1994;
``Simulated Annealing Cooling Schedules for the School Timetabling
Problem,'' submitted to Asia Pacific Journal of Operations Research,
1996.
- 4
-
Binder, K. ed.,
Monte Carlo Methods in Statistical Physics,
Springer-Verlag, Berlin, 1986.
- 5
-
Carter, M, and C. Tovey, ``When is the classroom assignment problem
hard?,'' Working Paper 89-03, Dept. of Industrial Engineering,
Univ. of Toronto, 1989. (submitted to Operations Research).
- 6
-
Colorni, A, M. Dorigo, and V. Maniezzo,
``On the use of genetic algorithms to solve the timetable problem,''
report 90-060, Dipartimento Di Elettronica E Informazione,
Politecnico Di Milano, Milan, Italy.
- 7
-
Costa, D, ``A Tabu Search algorithm for computing an operational
timetable,'' European Journal of Operational Research, 76 (1994),
98-110.
- 8
-
Dige, P., Carlos Lund and Hans F. Ravn,
``Timetabling by Simulated Annealing,''
in Applied Simulated Annealing, R.V. Vidal ed.,
Lecture Notes in Economics and Mathematical Systems, Springer, 1993.
- 9
-
de Werra, D,
``An introduction to timetabling,'' European Journal of
Operational Research, 19, 151-162, 1985.
- 10
-
de Werra, D,
``Extensions of coloring models for scheduling purposes,''
European Journal of Operational Research, to appear 1996.
- 11
-
Diekmann, R, R. Lüling, and J. Simon, ``Problem independent
distributed simulated annealing and its applications,'' in Applied
Simulated Annealing, R. V. Vidal (ed), Lecture Notes in Economics and
Mathematical Systems, Springer 1993.
- 12
-
Dowsland, K., Using Simulated Annealing for Efficient Allocation of
Students to Practical Classes.
Stat and OR Group, EBMS, Univ College of Swansea, UK, 1993.
- 13
-
Dowsland, K. and J. Thompson,
``Variants of Simulated Annealing for
the Examination Timetabling Problem,'' Working Paper,
Statistics and OR Group, European Business Management School,
Swansea SA2 8PP, UK. (1994)
- 14
-
Eglese, R.W. and Rand, G.K.,
``Conference seminar timetabling,''
Journal of the Operational Research Society, 38, 591-598 (1987).
- 15
-
Eiselt H. A, and G. Laporte, ``Combinatorial Optimization Problems
with Soft and Hard Requirements,'' J. Operational Research Society,
vol. 38, No. 9, pp. 785-795, 1987.
- 16
-
Elmohamed, S., G. C. Fox, P. Coddington, ``Course Scheduling using
Mean-Field Annealing, Part I: algorithm and Part II: implementation,''
Northeast Parallel Architectures Center technical report SCCS-782,
Syracuse University, 1996.
- 17
-
S. Elmohammed, P.D. Coddington and G.C Fox,
``A comparison of annealing techniques for academic course scheduling'',
Northeast Parallel Architectures Center technical report SCCS-777,
submitted to PATAT'97, the 2nd international conference on
the Practice and Theory of Automated Timetabling.
- 18
-
Even, S, A. Itai, and A. Shamir,
``On the complexity of the timetable and multicommodity flow problems,''
SIAM J. Computing 5 (76), 691-703.
- 19
-
Gary, M. and Johnson, D.
Computers and Intractability: A guide to the theory of
NP-completeness. Freeman, San Francisco (1979).
- 20
-
Gisl
n, L, Bo S
derberg, C. Peterson,
``Teachers and Classes with Neural Nets,''
Inter. J. of Neural Systems 1, 167 (1989).
- 21
-
Gisl
n, L, Bo S
derberg, C. Peterson,
``Scheduling High Schools with Neural Nets,'' Lund
University Preprint LU-TP-91-9, Lund, Sweden (1991),
(appeared in Neural Computation 1992).
- 22
-
Gosselin and M. Truchon, ``Allocation of Classrooms by Linear
Programming,'' Journal of Operational Research Society 37, 561
(1986).
- 23
-
Hertz, A,
``Tabu search for large scale timetabling problems,'' European
Journal of Operational Research 54, 39-47, 1991.
- 24
-
Hertz, A, ``Finding a feasible course schedule using Tabu search,''
Discrete Applied Mathematics 35, 255-270, 1992.
- 25
-
Hogg, T, B. Huberman, and C. Williams (editors), Artificial
Intelligence, special issue on Phase transitions and the search
space, 81, 1996.
- 26
-
Hopfield, J. J, and D. W. Tank,
``Neural Computation of Decisions in Optimization Problems,''
Biological Cybernetics 52, 141 (1985).
- 27
-
Huang, M, F. Romeo, and A. Sangiovanni-Vincentelli, ``An efficient
general cooling schedule for simulated annealing,'' IEEE International
Conf. on Computer Aided Design (ICCAD), 1986, pp. 381-384.
- 28
-
Johnson, D.,
``Timetabling university examinations,''
Journal of the Operational Research Society 41, 39-47 (1990).
- 29
-
Johnson, D, C. Aragon, L. McGeoch, and C. Schevon,
``Optimization by Simulated Annealing: an Experimental Evaluation, Part I
(Graph Partitioning),'' Operations Research 37, 865-892 (1989).
- 30
-
Johnson, D., and L. McGeoch, ``The Traveling Salesman
Problem: A Case Study in Local Optimization,'' in Local Search in
Combinatorial Optimization, E. H. Aarts and J. K. Lenstra (eds.),
Wiley and Sons. (to appear in 1997).
- 31
-
Kirkpatrick, S, C. D. Gelatt, Jr., and M. P. Vecchi, ``Optimization by
Simulated Annealing,'' Science 220 (13 May 1983), 671-680.
- 32
-
Kirkpatrick, S, ``Optimization by simulated annealing: Quantitative
studies,'' J. Stat. Physics 34 (1984), 976-986.
- 33
-
Ladkin, P. and R. Maddux,
``On binary constraint problems,'' Journal of the ACM 41 (1994),
pp. 435-469.
- 34
-
Leighton, F. T,
``A graph coloring algorithm for large scheduling problems,''
Journal of Research of the National Bureau of Standards 84, 1979,
489-506.
- 35
-
Lister, R.,''Annealing Networks and Fractal Landscapes,'' Proc. IEEE
Int. Conf. on Neural Nets, March 1993, Vol. I, pp 257-262.
- 36
-
Mackworth, A. K,
``Consistency in networks of relations,'' Artificial
Intelligence 8 (1977) pp. 99-118.
- 37
-
Miner, S., S. Elmohamed, and H. W. Yau, ``Optimizing Timetabling
Solutions Using Graph Coloring,'' 1995 NPAC REU program, NPAC,
Syracuse University, 1995.
- 38
-
Montanari, U., ``Networks of constraints: fundamental properties and
applications to picture processing,'' Information Sciences 7
(1974), pp. 95-132.
- 39
-
Mouritsen, O. G., Computer Studies of Phase Transitions and Critical
Phenomena, Springer-Verlag, Berlin, 1984.
- 40
-
Otten, R, and L. van Ginneken, The Annealing Algorithm,
Kluwer Academic Publishers, 1989.
- 41
-
Peterson, C, and Bo S
derberg,
``Artificial Neural Networks and Combinatorial Optimization
Problems,'' To appear in Local Search in Combinatorial
Optimization, E.H.L. Aarts and J.K. Lenstra, eds. Wiley and
Sons. (to appear 1997)
- 42
-
Peterson, C, and Bo S
derberg,
``A New Method for Mapping Optimization Problems onto Neural Nets'',
International Jr. of Neural Systems 1, 3 (1989).
- 43
-
Schaerf, A, ``A survey of automated timetabling,'' Department of
Software Technology, Report CS-R9567, CWI, Amsterdam, The Netherlands.
- 44
-
Shrijver, A,
Theory of Linear and Integer Programming, John Wiley and Sons,
Chichester, UK, 1986.
- 45
-
Shrijver, A,
A Course in Combinatorial Optimization, to appear in 1997.
- 46
-
Thompson, J, and K. Dowsland, ``General Cooling Schedules for
Simulated Annealing Based Timetabling Systems,'' Proceedings of the
1st International Conf. on the Practice and Theory of Automated
Timetabling, Napier Univ., Edinburgh 1995.
- 47
-
van Laarhoven, P. J. and E. H. Aarts,
Simulated Annealing: Theory and Applications. D. Reidel,
Dordrecht (1987).
- 48
-
Rene Vidal (ed), Applied Simulated Annealing, Lecture
Notes in Economics and Mathematical Systems no. 396, Springer-Verlag,
1993.
- 49
-
White, S. R, ``Concepts of scale in simulated annealing,''
Proceedings of the IEEE Int. Conference on Circuit Design, pp 646-651,
(1984).
Saleh Elmohamed
Thu Sep 4 11:43:55 EDT 1997