\newcommand{\etalchar}[1]{$^{#1}$}
\begin{thebibliography}{EDK{\etalchar{+}}91}

\bibitem[Abr91]{A:timetable}
D.~Abramson.
\newblock Constructing school timetables using simulated annealing: sequential
  and parallel algorithms.
\newblock {\em Managment Science}, 37:98--113, 1991.

\bibitem[ADK99]{ADK:cooling}
D.~Abramson, H.~Dang, and M.~Krishnamoorthy.
\newblock An empirical analysis of simulated annealing cooling schedules for
  solving the timetabling problem.
\newblock {\em Asia-Pacific Journal of Operation Research}, 16:1--122, 1999.

\bibitem[AF89]{AF:large}
J.~Aubin and J.~A. Ferland.
\newblock A large scale timetabling problem.
\newblock {\em Computers and Operations Research}, 16:67--77, 1989.

\bibitem[AF91]{AF:network}
A.~V.~B. Aiyer and F.~Fallside.
\newblock A hopfield network implementation of the viterbi algorithm for hidden
  markov models.
\newblock In {\em Proceedings of the International Joint Conference on Neural
  Networks}, pages 827--832, 1991.

\bibitem[AK89]{AK:anneal}
Emile~H.L. Aarts and Jan Korst.
\newblock {\em Simulated Annealing and Boltzmann Machines: A Stochastic
  Approach to Combinatorial Optimization and Neural Computing}.
\newblock Wiley, Chichester, 1989.

\bibitem[AKvL97]{AKvL:anneal}
E.~H. Aarts, J.~Korst, and P.~J. van Laarhoven.
\newblock Simulated annealing.
\newblock In Emile Aarts and Jan~Karel Lenstra, editors, {\em Local Search in
  Combinatorial Optimization}, Wiley-Interscience Series in Discrete
  Mathematics. John Wiley and Sons, Chichester, UK, 1997.

\bibitem[AL97]{AL:local}
Emile Aarts and Jan~Karel Lenstra, editors.
\newblock {\em Local Search in Combinatorial Optimization}.
\newblock Wiley, Chichester, England, 1997.

\bibitem[ANF90]{ANF:theory}
S.~V.~B. Aiyer, M.~Niranjan, and F.~Fallside.
\newblock A theoretical investigation into the performance of the hopfield
  model.
\newblock {\em IEEE Transcations on Neural Networks}, 1(2):204--215, June 1990.

\bibitem[Bre79]{B:color}
D.~Brelaz.
\newblock New methods to color vertices of a graph.
\newblock {\em Communications of the ACM}, 22:251--256, 1979.

\bibitem[Bru90]{Br:convergence}
J.~Bruck.
\newblock On the convergence properties of the hopfield model.
\newblock In {\em Proceedings of the IEEE}, volume~78, October 1990.

\bibitem[BV55]{BV:exp}
G.~E.~P. Box and P.~V. Voule.
\newblock The exploration and explotation of response surfaces: An example of
  the link between the fitted surface and the basic mechanism of the system.
\newblock {\em Biometric}, 11:287--323, 1955.

\bibitem[CG83]{CG:stability}
M.~A. Cohen and S.~Grossberg.
\newblock Absolute stability of global pattern formation and parallel memory
  storage by competitive neural networks.
\newblock {\em IEEE Transcations on Systems, Man and Cybernetics},
  13(5):813--825, September/October 1983.

\bibitem[CLR90]{CLR:algorithms}
Thomas~H. Cormen, Charles~E. Leiserson, and Ronald~L. Rivest.
\newblock {\em Introduction to Algorithms}.
\newblock MIT Press, Cambridge, MA, 1990.

\bibitem[Coo71]{C:complexity}
Stephen Cook.
\newblock The complexity of theorem proving procedures.
\newblock In {\em Proceedings of the Third Annual ACM Symposium on Theory of
  Computing}, pages 151--158, 1971.

\bibitem[CT92]{CT:hard}
M.~W. Carter and C.~A. Tovey.
\newblock When is the classroom assignment problem hard?
\newblock {\em Operations Research}, 40:28--39, 1992.

\bibitem[DLS93]{DLS:distributed}
R.~Diekmann, R.~Luling, and J.~Simon.
\newblock Problem independent distributed simulated annealing and its
  applications.
\newblock In R.~V.~V. Vidal, editor, {\em Lecture Notes in Economics and
  Mathematical Systems -- Applied Simulated Annealing}, volume 396. Springer,
  Berlin, Germany, 1993.

\bibitem[EDK{\etalchar{+}}91]{EDKT:neural}
S.~P. Eberhart, D.~Daud, D.~A. Kerns, T.~X. Brown, and A.~P. Thakoor.
\newblock Competitive neural architecture for hardware solution to the
  assignment problem.
\newblock {\em Neural Networks}, 91:431--442, 1991.

\bibitem[EFC96]{EFC:course}
M.~A.~S. Elmohamed, G.~Fox, and P.~Coddington.
\newblock Course scheduling using mean-field annealing, part i: algorithm and
  part ii: implementation.
\newblock {\em NPAC Technical Report}, SCCS(782), 1996.

\bibitem[EFC97]{EFC:academic}
M.~A.~S. Elmohamed, G.~Fox, and P.~Coddington.
\newblock Academic scheduling using simulated annealing with a rule-based
  preprocessor.
\newblock {\em NPAC Technical Report}, SCCS(781), 1997.

\bibitem[EIS76]{EIS:complex}
S.~Even, A.~Itai, and A.~Shamir.
\newblock On the complexity of timetable and multicommodity flow problems.
\newblock {\em SIAM Journal on Computing}, 5:691--703, 1976.

\bibitem[EL87]{EL:combinatorial}
H.~A. Eiselt and G.~Laporte.
\newblock Combinatorial optimization problems with soft and hard requirements.
\newblock {\em Journal of Operational Research Society}, 38(9):785--795, 1987.

\bibitem[FHL96]{FHL:object}
J.~A. Ferland, A.~Hertz, and A.~Lavoie.
\newblock An object-oriented methodology for solving assignment-type problems
  with neighborhood search techniques.
\newblock {\em Operations Research}, 44:347--359, 1996.

\bibitem[FL92]{FL:exchange}
J.~A. Ferland and A.~Lavoie.
\newblock Exchange procedures for timetabling problems.
\newblock {\em Discrete Applied Mathematics}, 35:237--253, 1992.

\bibitem[GJ79]{GJ:candi}
Michael~R. Garey and David~S. Johnson.
\newblock {\em Computers and Intractibility: A Guide to the Theory of
  {NP}-Completeness}.
\newblock W. H. Freeman and Company, New York, 1979.

\bibitem[Gol89]{Goldberg:genetic}
David~E. Goldberg.
\newblock {\em Genetic Algorithms in Search, Optimization, and Machine
  Learning}.
\newblock Addison--Wesley, Reading, MA, 1989.

\bibitem[GP92]{GP:function}
A.~H. Gee and R.~W. Prager.
\newblock Polyhedral combinatorics and neural networks.
\newblock {\em Neural Computation}, May 1992.

\bibitem[Gro88]{Gro:neural}
S.~Grossberg.
\newblock Nonlinear neural networks: Principles, mechanisms and architecture.
\newblock {\em Neural Networks}, 1(1):17--61, 1988.

\bibitem[GSP89]{GSP:teachers}
L.~Gislen, B.~Soderberg, and C.~Peterson.
\newblock Teachers and classes with neural nets.
\newblock {\em International Journal of Neural Systems}, 1:167--176, 1989.

\bibitem[GSP92]{GSP:complex}
L.~Gislen, B.~Soderberg, and C.~Peterson.
\newblock Complex scheduling with potts neural networks.
\newblock {\em Neural Computation}, 4:805--831, 1992.

\bibitem[GT86]{GT:allocation}
K.~Gosselin and M.~Truchon.
\newblock Allocation of classrooms by linear programming.
\newblock {\em Journal of Operational Research Society}, 37:561, 1986.

\bibitem[GW93]{GW:sat}
I.~P. Gent and T.~Walsh.
\newblock Towards an understanding of hill-climbing procedures for sat.
\newblock In {\em Proceedings of the 11th National Conference on Artificial
  Intelligence}, pages xxii+869, 28--33, 1993.

\bibitem[GW94]{GW:phase}
I.~P. Gent and T.~Walsh.
\newblock The sat phase transition.
\newblock In {\em ECAI94, Proceedings of the 11th European Conference on
  Artificial Intellidence}, pages xvi+832, 105--109, 1994.

\bibitem[HHW96]{HHW:phase}
T.~Hogg, B.~Huberman, and C.~Williams.
\newblock Phase transitions and the search space.
\newblock {\em Artificial Intelligence}, page~81, 1996.

\bibitem[HKP91]{HKP:neural}
J.~Hertz, A.~Krogh, and R.~Palmer.
\newblock {\em Introduction to the Theory of Neural Computation}.
\newblock Addison-Wesley, Redwood City, CA, USA, 1991.

\bibitem[Hol75]{Hol:adapt}
J.~H. Holland.
\newblock {\em Adaptation in Natural and Artificial Systems}.
\newblock University of Michigan Press, Ann Arbor, MI, 1975.

\bibitem[Hop82]{Hop:neural}
J.~J. Hopfield.
\newblock Neural networks and physical syetms with emergent collective
  computational abilities.
\newblock In {\em Proceedings of the National Academy of Sciences USA},
  volume~79, pages 2554--2558, April 1982.

\bibitem[Hop84]{Hop:network}
J.~J. Hopfield.
\newblock Neurons with graded response have collective computational properties
  like those of two-state neurons.
\newblock In {\em Proceedings of the National Academy of Sciences USA},
  volume~81, pages 3088--3092, May 1984.

\bibitem[HRSV86]{HRS:efficient}
M.~Huang, F.~Romeo, and A.~Sangiovanni-Vincentelli.
\newblock An efficient general cooling schedule for simulated annealing.
\newblock In {\em Proc. of the IEEE International Conference on Computer Aided
  Design (ICCAD)}, pages 381--384, 1986.

\bibitem[HT85]{HT:neural}
J.~J. Hopfield and D.~W. Tank.
\newblock Neural computation of decisions in optimization problems.
\newblock {\em Biological Cybernetics}, 52:141--152, 1985.

\bibitem[HT86]{HT:circuit}
J.~J. Hopfield and D.~W. Tank.
\newblock Computing with neural circuits: a model.
\newblock {\em Science}, 233:625--633, 1986.

\bibitem[JAMS89]{JAMS:optimization-I}
D.~Johnson, C.~Aragon, L.~McGeoch, and C.~Schevon.
\newblock Optimization by simulated annealing: an experimental evaluation, part
  i (graph partitioning).
\newblock {\em Operations Research}, 37:865--892, 1989.

\bibitem[JAMS91]{JAMS:optimization-II}
D.~Johnson, C.~Aragon, L.~McGeoch, and C.~Schevon.
\newblock Optimization by simulated annealing: an experimental evaluation, part
  ii (graph coloring and number partitioning).
\newblock {\em Operations Research}, 39:378--406, 1991.

\bibitem[JM97]{JM:traveling}
D.~Johnson and L.~McGeoch.
\newblock The traveling salesman problem: A case study in local optimization.
\newblock In {\em Local Search in Combinatorial Optimization},
  Wiley-Interscience Series in Discrete Mathematics and Optimization. John
  Wiley and Sons, Chichester, UK, 1997.

\bibitem[Kar72]{K:reduce}
R.~Karp.
\newblock Reducibility among combinatorial problems.
\newblock In {\em Complexity of Computer Computations}, pages 85--103. Plenum
  Press, New York, 1972.

\bibitem[KGV83]{KGV:sim}
S.~Kirkpatrick, C.~Gelatt, and M.~Vecchi.
\newblock Optimization by simulated annealing.
\newblock {\em Science}, 220:671--680, May 1983.

\bibitem[Kir84]{K:quant}
S.~Kirkpatrick.
\newblock Optimization by simulated annealing: Quantitive studies.
\newblock {\em Journal of Statistical Physics}, 34:976--986, 1984.

\bibitem[KS87]{KS:graph}
I.~Kanter and H.~Somplinsky.
\newblock Graph optimization problems and the potts glass.
\newblock {\em Journal of Physics A}, 20:L673--L679, 1987.

\bibitem[LG92]{LG:dynamics}
J.~E. Lewis and L.~Glass.
\newblock Nonlinear dynamics and symbolic dynamics of neural networks.
\newblock {\em Neural Computation}, 4(5):621--642, 1992.

\bibitem[Lis93]{L:fractal}
R.~Lister.
\newblock Annealing networks and fractal landscapes.
\newblock In {\em Proceedings of IEEE International Conference on Neural
  Networks}, volume~I, pages 257--262, March 1993.

\bibitem[LM94]{LM:binary}
P.~B. Ladkin and R.~D. Maddux.
\newblock On binary constraint problems.
\newblock {\em Journal of the ACM}, 41:435--469, 1994.

\bibitem[LPS00]{LPS:airline}
M.~Lagerholm, C.~Peterson, and B.~Soderberg.
\newblock Airline crew scheduling using potts means field techniques.
\newblock {\em European Journal of Operations Research}, 120:81--96, 2000.

\bibitem[Mac77]{M:consistency}
A.~K. Mackworth.
\newblock Consistency in networks of relations.
\newblock {\em Artificial Intelligence}, 8:99--118, 1977.

\bibitem[MEY95]{MEY:coloring}
S.~Miner, M.~A.~S. Elmohamed, and H.~W. Yau.
\newblock Optimizing timetabling solutions using graph coloring.
\newblock In {\em NSF REU Program -- 1995 Reports}. NPAC, Syracuse University,
  Syracuse, NY, 1995.

\bibitem[Mon74]{M:network}
U.~Montanari.
\newblock Networks of constraints: fundamental properties and applications to
  picture processing.
\newblock {\em Information Sciences}, 7:95--132, 1974.

\bibitem[Mou84]{M:phase}
O.~G. Mouritsen.
\newblock {\em Computer Studies of Phase Transitions and Critical Phenomena}.
\newblock Springer-Verlag, Berlin, Germany, 1984.

\bibitem[OB90]{OB:neural}
R.~G. Ogier and D.~A. Beyer.
\newblock Neural network solution to the link scheduling problem using convex
  relaxation.
\newblock In {\em Proceedings of the IEEE Global Telecommunications
  Conference}, pages 1371--1376, 1990.

\bibitem[OvG89]{OG:annealing}
R.H. J.~M. Otten and L.~P. P.~P. van Ginneken.
\newblock {\em The Annealing Algorithm}.
\newblock Kluwer, Norwell, MA, 1989.

\bibitem[PCSD89]{PCSD:scheduling}
C.~Petrie, R.~Causey, D.~Steiner, and V.~Dhar.
\newblock A planning problem: Revisable academic course scheduling.
\newblock {\em MCC Technical Report}, ACT-AI(020), June 1989.

\bibitem[PR88]{PR:discrete}
R.~G. Parker and R.~L. Rardin.
\newblock {\em Discrete Optimization}.
\newblock Academic Press, Inc., 1988.

\bibitem[PS89]{PS:mapping}
C.~Peterson and Bo~Soderberg.
\newblock A new method for mapping optimization problems onto neural nets.
\newblock {\em International Journal of Neural Systems}, 1:3--22, 1989.

\bibitem[Sim92]{Sim:neural}
M.~W. Simmen.
\newblock Neural network optimization.
\newblock {\em PhD Thesis}, 1992.

\bibitem[SK91]{SK:annealing}
P.~N. Strenski and S.~Kirkpatrick.
\newblock Analysis of finite length annealing schedules.
\newblock {\em Algorithmica}, 6:346--366, 1991.

\bibitem[SK93]{SK:sat}
B.~Selman and H.~A. Kautz.
\newblock Domain-independent extensions to gsat: Solving large structured
  satisfiability problems.
\newblock In {\em Proceedings of the International Joint Conference on
  Artificial Intelligence (IJCAI)}, Chambery, France, 1993. IJCAI.

\bibitem[SKC96]{SKC:sat}
B.~Selman, H.~A. Kautz, and B.~Cohen.
\newblock Local search strategies for satisfiability testing.
\newblock In {\em Proceedings of the 2nd DIMACS Implementation Challenge:
  Cliques and Coloring and Satisfiability}. American Mathematical Society,
  1996.

\bibitem[SLM92]{SLM:sat}
B.~Selman, H.~J. Levesque, and D.~G. Mitchell.
\newblock A new method for solving hard satisfiability problems.
\newblock In {\em Proceedings of the American Association of Artificial
  Intelligence (AAAI)}, pages 440--446, San Jose, CA, 1992. AAAI.

\bibitem[Sor91]{Sorkin:landscape}
Gregory~B. Sorkin.
\newblock {\em Theory and Practice of Simulated Annealing on Special Energy
  Landscapes}.
\newblock Department of Electrical Engineering and Computer Science, University
  of California, Berkeley, CA, 1991.

\bibitem[SY91]{SY:hard}
A.~A. Schaffer and M.~Yannakakis.
\newblock Simple local search problems that are hard to solve.
\newblock {\em SIAM Journal on Computing}, 20:56--87, 1991.

\bibitem[TCP88]{TCP:neural}
G.~A. Tagliarini, J.~F. Christ, and E.~W. Page.
\newblock A neural-network solution to the concentrator assignment problem.
\newblock In D.~Z. Anderson, editor, {\em Neural Information Processing
  Systems}, pages 775--782. American Institute of Physics, New York, 1988.

\bibitem[TD95]{TD:cooling}
J.~Thompson and K.~Dowsland.
\newblock General cooling schedules for simulated annealing based timetabling
  systems.
\newblock In {\em Proceedings of the 1st International Conference on the
  Practice and Theory of Automated Timetabling}, Edinburgh, Scotland, 1995.

\bibitem[TTR91]{TTR:neural}
L.~Tarassenko, J.~N. Tombs, and J.~H. Reynolds.
\newblock Neural network architectures for content-addressable memory.
\newblock In {\em IEE Proceedings, Series F}, volume 138, pages 33--39,
  February 1991.

\bibitem[Vid93]{V:applied}
R.~V.~V. Vidal, editor.
\newblock {\em Applied Simulated Annealing}.
\newblock Lecture Notes in Economics and Mathematical Systems. Springer,
  Berlin, Germany, 1993.

\bibitem[vLA87]{vLA:anneal}
Peter J.~M. van Laarhoven and Emile H.~L. Aarts.
\newblock {\em Simulated Annealing: Theory and Applications}.
\newblock Reidel, Dordrecht, NL, 1987.

\bibitem[Whi84]{Wh:scale}
S.~R. White.
\newblock Concepts of scale in simulated annealing.
\newblock In {\em Proceedings of the IEEE International Conference on Circuit
  Design}, pages 646--651, 1984.

\bibitem[WP88]{WP:hop}
V.~Wilson and G.~S. Pawley.
\newblock On the stability of the tsp problem algorithm of hopfield and tank.
\newblock {\em Biological Cybernetics}, 58:63--70, 1988.

\bibitem[Wu82]{Wu:potts}
F.~Y. Wu.
\newblock The potts model.
\newblock {\em Reviews of Modern Physics}, 54:235--268, 1982.

\end{thebibliography}
