Next: About this document
Up: No Title
Previous: Glossary
References
- 1
-
J. Hopfield and D. Tank, ```Neural' computation of decisions in
optimization problems,'' Biol. Cybern, 52 (1985), 141-152.
- 2
-
C. Reeves, editor. Modern Heuristic Techniques for Combinatorial
Problems, chapter 4, John Wiley and Sons, 1993.
- 3
-
A. Schrijver, Theory of Linear and Integer Programming. John
Wiley and Sons, Chichester, UK (1986).
- 4
-
A. Schrijver, A Course in Combinatorial Optimization, to appear
1996.
- 5
-
C. Papadimitriou and M. Yannakakis,
``Note on recognizing integer polyhedra,'' Combinatorica,
10(1):107-109, 1990.
- 6
-
Gerhard Reinelt,
The Traveling Salesman, Computational Solutions for TSP
Applications, Springer-Verlag (1994).
- 7
-
Peterson, S
derberg,
``A New Method for Mapping Optimization Problems onto Neural Nets,''
International Jr. of Neural Systems 1, 3 (1989).
- 8
-
Gisl
n, S
derberg, Peterson,
``Teachers and Classes with Neural Nets,'' Inter. Jr. of Neural
Systems 1, 167 (1989).
- 9
-
Gisl
n, S
derberg, Peterson, ``Scheduling High
Schools with Neural Nets,'', Lund University Preprint LU-TP-91-9,
Lund, Sweden (1991).
- 10
-
S. Elmohamed, G. Fox, P. Coddington, and H. Yau, ``Mean field
annealing and class scheduling,'', Manuscript, NPAC, Syracuse
University, 1995.
- 11
-
E, Aarts and J. Korst, ``Boltzmann machines for traveling salesman
problems,'' European J. of Operational Research 39 (1989),
79-95.
- 12
-
Silver, E.A., R.V.V. Vidal and D. de Werra,
``A tutorial on heuristics,'' European J. of Operational
Research 5 (1980), 153-162.
- 13
-
Forest, Richard,
Ensemble of Simulated Annealing, SDSC, San Diego, California, 1994.
- 14
-
Van Laarhoven, and Aarts,
Simulated Annealing: Theory and Applications. D. Reidel,
Dordrecht (1987).
- 15
-
D. Johnson, C. Aragon, L. McGeoch, and C. Schevon,
``Optimization by Simulated Annealing: an Experimental Evaluation, Part
I (Graph Partitioning),'' Operations Research 37, 865-892 (1989).
- 16
-
D. Johnson, C. Aragon, L. McGeoch, and C. Schevon,
``Optimization by Simulated Annealing: an Experimental Evaluation, Part
II (Graph Coloring and number partitioning),'' Operations
Research 39, No. 3, 865-892 (1991).
- 17
-
Applied Simulated Annealing, Rene Vidal (ed.), Lecture
Notes in Economics and Mathematical Systems no. 396, Springer-Verlag,
1993.
- 18
-
N. Boissin, and J.-L. Lutton, ``A parallel simulated annealing
algorithm,'' Parallel Computing 19, 859-872, 1993.
- 19
-
M. G. A. Verhoeven, and Emile H. L. Aarts, ``Parallel local search
techniques,'' Manuscript, Philips Research Laboratories, Eindhoven,
The Netherlands, 1995.
- 20
-
Emile Aarts, Jan Korst, and Peter von Laarhoven, ``Simulated
annealing,'' in Local Search in Combinatorial Optimization,
E. H. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, UK (to
appear in 1996).
- 21
-
A. Hertz and D. de Werra, ``The tabu search metaheuristic: how we used
it,'' Annals of Mathematics and Artificial Intelligence, 1
(1990) 111-121.
- 22
-
F. Glover, ``Tabu search fundamentals and uses,'' Manuscript, School
of Business, University of Colorado, Boulder, CO, May 1994.
- 23
-
F. Glover, ``Multilevel tabu search and embedded search neighborhoods
for traveling salesman problem,'' Manuscript, School of Business,
University of Colorado, Boulder, CO, May 1991.
- 24
-
S. R. White, ``Concepts of scale in simulated annealing,'' In
Proceedings of the IEEE International Conf. on Circuit Design (ICCD),
pages 646-651, 1984.
- 25
-
R. H. J. Otten and L. P. P. van Ginneken, The Annealing
Algorithm. Kluwer Academic Publishers, 1989.
- 26
-
J. Lam and J.-M. Delosome, ``An efficient simulated annealing
schedule: Derivation,'' TR 8816, Yale University, Dept. of Computer
Science, Sept. 1988.
- 27
-
M. Lundy and A. Mees, ``Convergence of the annealing algorithm,'',
Mathematical Programming, 34, 111-124, 1986.
- 28
-
J. Thompson and K. Dowsland, ``Examination timetabling by simulated
annealing,'' E.B.M.S, Swansea University, Swansea, UK 1994/95.
- 29
-
M. Huang, F. Romeo, and A. Sangiovanni-Vincentelli, ``An efficient
general cooling schedule for simulated annealing,'' In
Proceedings of the International Conf. on Computer-Aided Design
(ICCAD), pp 381-384, 1986.
- 30
-
J. Lam and J.-M. Delosme, ``An efficient simulated annealing schedule:
Implementation and evaluation,'' TR 8817, Yale University, Dept. of
Computer Science, Sept. 1988.
- 31
-
F. Catthoor, H. de Man and J. Vandewalle, ``SAMURAI: a general and
efficient simulated-annealing schedule with fully adaptive annealing
parameters,'' Integration, the VLSI Journal, 6, 147-178, 1988.
- 32
-
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization:
algorithms and complexity. Prentice Hall, 1982.
- 33
-
J. J. Hopfield, ``Neurons with graded response have collective
computational properties like those of two-state neurons,''
Proceedings of the National Academy of Science, US, 81, 3088-3092
(1984).
- 34
-
David Johnson,
``Local Optimization and the TSP,'' Springer Lecture Notes in
Computer Science 443, 446-461, Springer-Verlag, 1990.
- 35
-
D. Johnson 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.), John Wiley and
Sons, UK (to appear in 1996).
- 36
-
R. Durbin and D. Willshaw, ``An analogue approach to the traveling
salesman problem using an elastic net method,'' Nature 326
(April 16, 1987), pp 689-691.
- 37
-
T. Kohonen, Self-Organization and Associative Memory, Springer-Verlag,
Berlin, 1988.
- 38
-
R. Durbin, R. Szeliski, and A. Yuille, ``An analysis of the elastic
net approach to the traveling salesman problem,'' Neural
Computation 1 (1989), pp. 348-358.
- 39
-
J. Holland, ``Genetic Algorithms,'' Scientific American 1,
vol. 267, pp 66-72, July 1992.
- 40
-
J. Bentley, ``Experiments on traveling salesman heuristics,'' 1st
annual ACM-SIAM Symposium on Discrete Algorithms, pp. 91-99, San
Francisco, CA Jan 1990.
- 41
-
S. Lin and B. Kernighan, ``An effective heuristic algorithm for the
traveling salesman problem,'' Operations Research 21,
pp. 498-516, 1973.
- 42
-
S. Elmohamed, G. Fox, P. Coddington, and H. Yau, ``Simulated annealing
and class scheduling,'', Manuscript, NPAC, Syracuse University,
January 1996.
- 43
-
A. Hertz, E. Taillard, and D. de Werra, ``Tabu Search,''
in Local Search in Combinatorial Optimization, E. H. Aarts and
J. K. Lenstra (eds.), John Wiley and Sons, UK (to appear in 1996).
- 44
-
D. Costa, ``A Tabu Search algorithm for computing an operational
timetable,'' European Journal of Operational Research (EJOR), 76,
(1994), 98-110.
HPF demo web account
Mon Nov 18 19:45:42 EST 1996