Skip to main content
SpringerLink
Log in

Editor's foreword

  • Published:
Algorithmica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. E. H. L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines: a Stochastic Approach to Combinatorial Optimization and Neural Computing. Technical Report, Philips Research Laboratories, 1988.

  2. E. H. L. Aarts and P. J. M. van Laarhoven.Simulated Annealing: Theory and Applications. Reidel, Dordrecht, 1987.

    MATH  Google Scholar 

  3. C. R. Aragon, D. S. Johnson, L. A. McGeoch, and C. Schevon. Simulated Annealing Performance Studies. Workshop on Statistical Physics in Engineering and Biology, April 1984.

  4. P. Banerjee and M. Jones. A Parallel Simulated Annealing Algorithm for Standard Cell Placement on a Hypercube Computer.Proc. ICCAD, pages 34–37, 1986.

  5. D. A. Bell, F. J. McErlean, P. M. Stewart, and W. Arbuckle. Clustering Tuples in Databases.Comput. J. 31 (3): 253–257, 1988.

    Article  Google Scholar 

  6. K. Binder.Monte Carlo Methods in Statistical Physics. Springer-Verlag, Berlin, 1978.

    Google Scholar 

  7. E. Bonomi and J. Lutton. TheN-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm.SIAM Rev.,26 (4): 551–568, October 1984.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Carnevali, L. Coletti, and S. Patarnello. Image Processing by Simulated Annealing.IBM J. Res. Develop.,29: 569–579, 1985.

    Article  Google Scholar 

  9. J. H. Cervantes and R. R. Hildebrant. Comparison of Three Neuron-Based Computation Schemes.Proc. IEEE First Annu. Internat. Conf. on Neural Networks, pages III-657-671, June 1987.

  10. T.-S. Chiang, C-T. Hwang, and S-J. Shiu. Diffusions for Global Optimization in ℝn.SIAM J. Control Optimi.,25 (3): 737–753, May 1987.

    Article  MATH  Google Scholar 

  11. C. M. Fiduccia and R. M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions.Proc. 19th Design Automation Conf., pages 175–181, 1982.

  12. H. Fleisher, J. Giraldi, D. B. Martin, R. L. Phoenix, and M. A. Tavel. Simulated Annealing as a Tool for Logic Optimization in a CAD Environment.Proc ICCAD, pages 203–205, 1985.

  13. A. El Gamal and I. Shperling. Design of Good Codes via Simulated Annealing. Workshop on Statistical Physics in Engineering and Biology, IBM T. J. Watson Research Center, April 1984.

  14. M. R. Garey and D. S. Johnson.Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  15. S. Gelfand. Analysis of Simulated Annealing Type of Algorithms. Technical Report LIDS-TH-1688, Massachussets Institute of Technology, Cambridge, MA, 1987.

    Google Scholar 

  16. S. Geman and D. Geman. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images.IEEE Trans. Pattern Analy. Mach. Intell.,6: 721–741, 1984.

    Article  MATH  Google Scholar 

  17. S. Geman and C-R. Hwang. Diffusions for Global Optimization.SIAM J. Control Optim. 24 (5): 1031–1043, September 1986.

    Article  MATH  MathSciNet  Google Scholar 

  18. B. Gidas. Global Minimization via the Langevin Equation.Proc. 24th Conf. on Decision and Control, pages 774–778, December 1985.

  19. K. Grover. A New Simulated Annealing Algorithm for Standard Cell Placement.Proc. ICCAD, pages 378–379, 1986.

  20. B. Hajek. A Tutorial Survey of Theory and Applications of Simulated Annealing.Proc. 24th Conf. on Decision and Control, pages 755–760, December 1985.

  21. J. M. Hammersley and D. C. Handscomb.Monte Carlo Methods. Wiley, New York, 1964.

    MATH  Google Scholar 

  22. G. E. Hinton and T. J. Sejnowski. Optimal Perceptual Inference.Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pages 448–453, 1983.

  23. G. E. Hinton and T. J. Sejnowski. Learning and Relearning in Boltzmann Machines.Parallel Distrib. Process. Explor. Microstruct. Cogn. 1: 282–317, 1986.

    Google Scholar 

  24. J. J. Hopfield and D. W. Tank. Neural Computations of Decisions on Optimization Problems.Biol. Cybenet,52 (3):141–152, 1985.

    MATH  MathSciNet  Google Scholar 

  25. S. Hustin. Tim, a New Standard Cell Placement Program Based on the Simulated Annealing Algorithm. Master's thesis, University of California, Berkeley, CA, March 1988.

    Google Scholar 

  26. J. Burns, A. Casotto, M. Igusa, F. Marron, F. Romeo, A. Sangiovanni-Vincentelli, C. Sechen, H. Shin, G. Srinath, and H. Yaghutiel. Mosaico: An Integrated Macro-Cell Layout System.Proc. VLSI'87, pages 133–148, August 10–12, 1987.

  27. B. Kernighan and S. Lin. An Efficient Procedure for Partitioning Graphs.Bell System Tech. J.,10: 291–307, February 1970.

    Google Scholar 

  28. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Anealing.Science,220 (4598): 671–680, 13 May 1983.

    Article  MathSciNet  Google Scholar 

  29. H. J. Kushner. Asymptotic Global Behaviour for Stochastic Approximations and Diffusions with Slowly Decreasing Noise Effects. Technical Report 85-7, Lefshetz Center for Dynamical Systems, Brown University, 1985.

  30. J. Lam and J.-M. Delosme. Logic Minimization Using Simulated Annealing,Proc. ICCAD, pages 348–352, 1986.

  31. J. Landa, K. Scheff, and H. Szu. Binocular Fusion Using Simulated Annealing.Proc. IEEE First Annu. Internat. Conf. on Neural Networks, pages IV-327–334, June 1987.

  32. B. C. Levy and M. B. Adams. Global Optimization with Stochastic Neural Networks.Proc. First Internat. Conf. on Neural Networks, pages III-681–690, June 1987.

  33. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, and A. H. Teller. Equation of State Calculations by Fast Computer Machines.J. Chem. Phys. 21: 1087, 1953.

    Article  Google Scholar 

  34. S. Nahar, S. Sahni, and E. Shragowitz. Simulated Annealing and Combinatorial Optimization.Proc. 23rd Design Automation Conf., pages 293–299, 1986.

  35. J. D. Pincus and A. Despain. Delay Reduction Using Simulated Annealing,Proc. 23rd Design Automation Conf., 1986.

  36. B. D. Ripley.Stochastic Simulation, Wiley, New York, 1987.

    MATH  Google Scholar 

  37. F. Romeo, A. Sangiovanni-Vincentelli, and C. Sechen. Research on Simulated Annealing at Berkeley.Proc. CICC, pages 652–657, 1984.

  38. K. Scheff and H. Szu. 1-D Optical Cauchy Machine Infinite Film Spectrum Search.Proc. IEEE First Annu. Internat. Conf. on Neural Networks, pages III-673–679, June 1987.

  39. J. T. Schwartz. Fast Probalistic Algorithms for Verification of Polynomial Identities.J. Assoc. Comput. Mach.,27 (4), October 1980.

  40. C. Sechen and K.-W. Lee. An Improved Simulated Annealing Algorithm for Row-Based Placement.Proc. ICCAD, pages 478–483, 1987.

  41. C. Sechen and A. Sangiovanni-Vincentelli. The Timber Wolf Placement and Routing Package.Proc. 1984 Custom Integrated Circuit Conf., pages 522–527, 1984.

  42. C. Sechen and A. Sangiovanni-Vincentelli. The Timber Wolf Placement and Routing Package.IEEE J. Solid-State Circuits,20 (2): 510, April 1985.

    Article  Google Scholar 

  43. C. Sechen and A. Sangiovanni-Vincentelli. Timber Wolf 3.2: A New Standard Cell Placement and Global Routing Package.Proc. 23rd Design Automation Conf., pages 432–439, 1986.

  44. T. J. Sejnowski and G. E. Hinton. Separating Figures from Ground with a Boltzmann Machine.Vision, Brain, and Cooperative Computation, pages 703–724, 1985.

  45. A. D. Sokal. New Monte Carlo Algorithms for Quantum Field Theory and Critical Phenomena, or How to Beat Critical Slowing Down.Proc. 8th Internat. Congr. of Mathematical Physics, June 1986.

  46. E. D. Sontag and H. J. Sussman. Image Restoration and Segmentation Using Simulated Annealing.Proc. 24th Conf. on Decision and Control, pages 768–773, December 1985.

  47. H. Szu. Fast Simulated Annealing.Phys. Lett. A,122 (3, 4): 157–162, June 1987.

    Article  Google Scholar 

  48. H. C. Tijms.Stochastic Modeling and Analysis: A Computational Approach. Wiley, Chichester, 1986.

    Google Scholar 

  49. D. Vanderbilt and S. Louie. A Monte Carlo Simulated Annealing Approach to Optimization over Continuous Variables.J. Comput. Phys.,52 (2): 259–271, November 1984.

    Article  MathSciNet  Google Scholar 

  50. V. Černy. Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm.J. Optim. Theory Appl,45: 41–51, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  51. M. P. Vecchi and S. Kirkpatrick. Global Wiring by Simulated Annealing.IEEE Trans. Computer-Aided Design,2 (4): 215–222, October 1983.

    Article  Google Scholar 

  52. D. F. Wong, H. W. Leong, and C. L. Lui. Multiple PLA Folding by the Method of Simulated Annealing.Proc. CICC, pages 351–355, 1986.

  53. D. F. Wong, H. W. Leong, and C. L. Liu.Simulated Annealing for VLSI Design. Kluwer Academic, Boston, 1988.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, 94720, CA, USA

    Alberto Sangiovanni-Vincentelli

Authors
  1. Alberto Sangiovanni-Vincentelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sangiovanni-Vincentelli, A. Editor's foreword. Algorithmica 6, 295–301 (1991). https://doi.org/10.1007/BF01759048

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01759048

Search

Navigation