Publisher
Springer International Publishing
Reference18 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)
2. Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
3. Černý, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41–51 (1985)
4. Borysenko, O., Byshkin, M.: Coolmomentum: a method for stochastic optimization by langevin dynamics with simulated annealing. Sci. Rep. 11, 10705 (2021)
5. Lin, S.-W., Cheng, C.-Y., Pourhejazy, P., Ying, K.-C., Lee, C.-H.: New benchmark algorithm for hybrid flowshop scheduling with identical machines. Expert Syst. Appl. 183, 115422 (2021)