×

Revisiting simulated annealing: a component-based analysis. (English) Zbl 1458.90646

Summary: Simulated annealing (SA) is one of the oldest metaheuristics and has been adapted to solve many combinatorial optimization problems. Over the years, many authors have proposed both general and problem-specific improvements and variants of SA. We propose to accumulate this knowledge into automatically configurable, algorithmic frameworks so that for new applications that wealth of alternative algorithmic components is directly available for the algorithm designer without further manual intervention. Here, we describe SA as an ensemble of algorithmic components, and describe SA variants from the literature within these components. We show the advantages of our proposal by (i) implementing existing algorithmic components of variants of SA, (ii) studying SA algorithms proposed in the literature, (iii) improving SA performance by automatically designing new state-of-the-art SA implementations and (iv) studying the role and impact of the algorithmic components based on experimental data. Our experiments consider three common combinatorial optimization problems, the quadratic assignment problem and two variants of the permutation flow shop problem.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90C27 Combinatorial optimization
90-08 Computational methods for problems pertaining to operations research and mathematical programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Aarts, E. H.L.; Korst, J. H.M.; Michiels, W., Simulated annealing, Search Methodologies, 187-210 (2005), Springer
[2] Abramson, D., Constructing school timetables using simulated annealing: sequential and parallel algorithms, Manage. Sci., 37, 1, 98-113 (1991)
[3] Abramson, D.; Amoorthy, M. K.; Dang, H., Simulated annealing cooling schedules for the school timetabling problem, Asia-Pac. J. Oper. Res., 16, 1, 1-22 (1999) · Zbl 1053.90508
[4] Andersen, K.; Vidal, R. V.V.; Iversen, V. B., Design of a teleprocessing communication network using simulated annealing, (Vidal, R. V.V., Applied Simulated Annealing (1993), Springer), 201-215
[5] Andrieu, C.; de Freitas, N.; Doucet, A.; Jordan, M. I., An introduction to MCMC for machine learning, Mach. Learn, 50, 1-2, 5-43 (2003) · Zbl 1033.68081
[6] Appleby, J.; Blake, D.; Newman, E., Techniques for producing school timetables on a computer and their application to other scheduling problems, Comput. J., 3, 4, 237-245 (1961) · Zbl 0201.48903
[7] Balaprakash, P.; Birattari, M.; Stützle, T., Improvement strategies for the F-race algorithm: sampling design and iterative refinement, (Bartz-Beielstein, T.; Blesa, M. J.; Blum, C.; Naujoks, B.; Roli, A.; Rudolph, G.; Sampels, M., Hybrid Metaheuristics. Hybrid Metaheuristics, Lecture Notes in Computer Science, Vol. 4771 (2007), Springer: Springer Heidelberg, Germany), 108-122
[8] Battiti, R.; Tecchiolli, G., Simulated annealing and tabu search in the long run: a comparison on QAP tasks, Comput. Math. Appl., 28, 6, 1-8 (1994) · Zbl 0812.68067
[9] Beham, A.; Affenzeller, M.; Wagner, S., Instance-based algorithm selection on quadratic assignment problem landscapes, Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1471-1478 (2017), ACM
[10] Benlic, U.; Hao, J. K., Breakout local search for the quadratic assignment problem, Appl. Math. Comput., 219, 9, 4800-4815 (2013) · Zbl 1401.90108
[11] Bezerra, L. C.T.; López-Ibáñez, M.; Stützle, T., Automatic component-wise design of multi-objective evolutionary algorithms, IEEE Trans. Evol. Comput., 20, 3, 403-417 (2016)
[12] Birattari, M.; Yuan, Z.; Balaprakash, P.; Stützle, T., F-race and iterated F-race: an overview, (Bartz-Beielstein, T.; Chiarandini, M.; Paquete, L.; Preuss, M., Experimental Methods for the Analysis of Optimization Algorithms (2010), Springer: Springer Berlin, Germany), 311-336 · Zbl 1204.68280
[13] Bohachevsky, I. O.; Johnson, M. E.; Stein, M. L., Generalized simulated annealing for function optimization, Technometrics, 28, 3, 209-217 (1986) · Zbl 0609.65045
[14] Breiman, L., Random forests, Mach. Learn., 45, 1, 5-32 (2001) · Zbl 1007.68152
[15] Burkard, R. E.; Çela, E.; Pardalos, P. M.; Pitsoulis, L. S., The quadratic assignment problem, (Pardalos, P. M.; Du, D. Z., Handbook of Combinatorial Optimization, Vol. 2 (1998), Kluwer Academic Publishers), 241-338 · Zbl 0944.90071
[16] Burkard, R. E.; Karisch, S. E.; Rendl, F., QAPLIB-a quadratic assignment problem library, J. Global Optim., 10, 4, 391-403 (1997) · Zbl 0884.90116
[17] Burkard, R. E.; Rendl, F., A thermodynamically motivated simulation procedure for combinatorial optimization problems, Eur. J. Oper. Res., 17, 2, 169-174 (1984) · Zbl 0541.90070
[18] Burke, E. K.; Bykov, Y., The Late Acceptance Hill-Climbing Heuristic (2012), University of Stirling, Tech. Rep. CSM-192 · Zbl 1380.90231
[19] Burke, E. K.; Bykov, Y., The late acceptance hill-climbing heuristic, Eur. J. Oper. Res., 258, 1, 70-78 (2017) · Zbl 1380.90231
[20] Çela, E., The Quadratic Assignment Problem: Theory and Algorithms (1998), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht, The Netherlands · Zbl 0909.90226
[21] Chen, R. M.; Hsieh, F. R., An exchange local search heuristic based scheme for permutation flow shop problems, Appl. Math. Inf. Sci., 8, 1, 209-215 (2014)
[22] Černý, V., A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Optim. Theory Appl., 45, 1, 41-51 (1985) · Zbl 0534.90091
[23] Cohn, H.; Fielding, M. J., Simulated annealing: searching for an optimal temperature, SIAM J. Optim., 9, 3, 779-802 (1999) · Zbl 0957.60072
[24] Connolly, D. T., An improved annealing scheme for the qap, Eur. J. Oper. Res., 46, 1, 93-100 (1990) · Zbl 0715.90079
[25] Dantas, A. L.; Pozo, A. T.R., A meta-learning algorithm selection approach for the quadratic assignment problem, 2018 IEEE Congress on Evolutionary Computation (CEC), 1-8 (2018), IEEE
[26] Dueck, G., New optimization heuristics: the great deluge algorithm and the record-to-record travel, J. Comput. Phys., 104, 1, 86-92 (1993) · Zbl 0773.65042
[27] Dueck, G.; Scheuer, T., Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys., 90, 1, 161-175 (1990) · Zbl 0707.65039
[28] Fernandez-Viagas, V.; Ruiz, R.; Framiñán, J. M., A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Eur. J. Oper. Res., 257, 3, 707-721 (2017) · Zbl 1394.90271
[29] Fielding, M. J., Simulated annealing with an optimal fixed temperature, SIAM J. Optim., 11, 2, 289-307 (2000) · Zbl 1010.90069
[30] Fischetti, M.; Monaci, M.; Salvagnin, D., Three ideas for the quadratic assignment problem, Oper. Res., 60, 4, 954-964 (2012) · Zbl 1260.90117
[31] Fogel, D. B.; Owens, A. J.; Walsh, M. J., Artificial Intelligence Through Simulated Evolution (1966), John Wiley & Sons · Zbl 0148.40701
[32] Fox, B. L., Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Ann. Oper. Res., 41, 2, 47-67 (1993) · Zbl 0771.90083
[33] Fox, B. L., Simulated annealing: folklore, facts, and directions, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, 17-48 (1995), Springer · Zbl 0831.65065
[34] Framiñán, J. M.; Leisten, R.; Ruiz, R., Manufacturing Scheduling Systems: An Integrated View on Models, Methods, and Tools (2014), Springer: Springer New York, NY · Zbl 1354.90005
[35] Franzin, A.; Stützle, T., Comparison of acceptance criteria in randomized local searches, (Lutton, E.; Legrand, P.; Parrend, P.; Monmarché, N.; Schoenauer, M., EA 2017: Artificial Evolution. EA 2017: Artificial Evolution, Lecture Notes in Computer Science, Vol. 10764 (2017), Springer: Springer Heidelberg, Germany), 16-29
[36] Franzin, A., Stützle, T., 2018. Revisiting simulated annealing: a component-based analysis: supplementaty material. http://iridia.ulb.ac.be/supp/IridiaSupp2018-001; Franzin, A., Stützle, T., 2018. Revisiting simulated annealing: a component-based analysis: supplementaty material. http://iridia.ulb.ac.be/supp/IridiaSupp2018-001
[37] Garey, M. R.; Johnson, D. S.; Sethi, R., The complexity of flowshop and jobshop scheduling, Math. Oper. Res., 1, 117-129 (1976) · Zbl 0396.90041
[38] Geman, S.; Geman, D., Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Mach. Intell., 6, 6, 721-741 (1984) · Zbl 0573.62030
[39] (Gendreau, M.; Potvin, J. Y., Handbook of Metaheuristics, 2nd ed., International Series in Operations Research & Management Science, Vol. 146 (2010), Springer: Springer New York, NY) · Zbl 1198.90002
[40] Genuer, R.; Poggi, J. M.; Tuleau-Malot, C., Variable selection using random forests, Pattern Recognit. Lett., 31, 14, 2225-2236 (2010)
[41] Glover, F., Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156-166 (1977)
[42] Hajek, B., Cooling schedules for optimal annealing, Math. Oper. Res., 13, 2, 311-329 (1988) · Zbl 0652.65050
[43] Hajek, B.; Sasaki, G., Simulated annealing-to cool or not, Syst. Control Lett., 12, 5, 443-447 (1989) · Zbl 0685.93075
[44] Hansen, P.; Jaumard, B., Algorithms for the maximum satisfiability problem, Computing, 44, 279-303 (1990) · Zbl 0716.68077
[45] Henderson, D.; Jacobson, S. H.; Johnson, A. W., The theory and practice of simulated annealing, Handbook of Metaheuristics, 287-319 (2003), Springer · Zbl 1102.90381
[46] Holland, J., Adaptation in Natural and Artificial Systems (1975), University of Michigan Press
[47] Hoos, H. H., Programming by optimization, Commun. ACM, 55, 2, 70-80 (2012)
[48] Hoos, H. H.; Stützle, T., Stochastic Local Search—Foundations and Applications (2005), Morgan Kaufmann Publishers: Morgan Kaufmann Publishers San Francisco, CA · Zbl 1126.68032
[49] Hu, T. C.; Kahng, A. B.; Tsao, C. W.A., Old bachelor acceptance: a new class of non-monotone threshold accepting methods, ORSA J. Comput., 7, 4, 417-425 (1995) · Zbl 0843.90099
[50] Hussin, M. S.; Stützle, T., Tabu search vs. simulated annealing for solving large quadratic assignment instances, Comput. Oper. Res., 43, 286-291 (2014) · Zbl 1348.90516
[51] Hutter, F.; Hoos, H. H.; Leyton-Brown, K., Sequential model-based optimization for general algorithm configuration, (Coello, C. A.C., Learning and Intelligent Optimization, 5th International Conference, LION 5. Learning and Intelligent Optimization, 5th International Conference, LION 5, Lecture Notes in Computer Science, Vol. 6683 (2011), Springer: Springer Heidelberg, Germany), 507-523
[52] Hutter, F.; Hoos, H. H.; Leyton-Brown, K.; Stützle, T., ParamILS: an automatic algorithm configuration framework, J. Artif. Intell. Res., 36, 267-306 (2009) · Zbl 1192.68831
[53] Ishibuchi, H.; Misaki, S.; Tanaka, H., Modified simulated annealing algorithms for the flow shop sequencing problem, Eur. J. Oper. Res., 81, 2, 388-398 (1995) · Zbl 0927.90048
[54] Jackson, W. G.; Özcan, E.; John, R. I., Move acceptance in local search metaheuristics for cross-domain search, Expert Syst. Appl., 109, 131-151 (2018)
[55] Jajodia, S.; Minis, I.; Harhalakis, G.; Proth, J. M., CLASS: Computerized layout solutions using simulated annealing, Int. J. Prod. Res., 30, 1, 95-108 (1992) · Zbl 0825.90487
[56] Jerrum, M., Large cliques elude the metropolis process, Random Struct. Algorithms, 3, 4, 347-359 (1992) · Zbl 0754.60018
[57] Jerrum, M.; Sinclair, A., The Markov chain Monte Carlo method: an approach to approximate counting and integration, (Hochbaum, D. S., Approximation Algorithms For NP-hard Problems (1996), PWS Publishing Co.), 482-520
[58] Johnson, A. W.; Jacobson, S. H., On the convergence of generalized hill climbing algorithms, Discrete Appl. Math., 119, 1, 37-57 (2002) · Zbl 0994.90115
[59] Johnson, D. S.; Aragon, C. R.; McGeoch, L. A.; Schevon, C., Optimization by simulated annealing: an experimental evaluation: part I, graph partitioning, Oper. Res., 37, 6, 865-892 (1989) · Zbl 0698.90065
[60] Johnson, D. S.; Aragon, C. R.; McGeoch, L. A.; Schevon, C., Optimization by simulated annealing: an experimental evaluation: part II, graph coloring and number partitioning, Oper. Res., 39, 3, 378-406 (1991) · Zbl 0739.90055
[61] KhudaBukhsh, A. R.; Xu, L.; Hoos, H. H.; Leyton-Brown, K., SATenstein: automatically building local search SAT solvers from components, (Boutilier, C., Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09) (2009), AAAI Press: AAAI Press Menlo Park, CA), 517-524
[62] KhudaBukhsh, A. R.; Xu, L.; Hoos, H. H.; Leyton-Brown, K., SATEnstein: automatically building local search SAT solvers from components, Artif. Intell., 232, 20-42 (2016) · Zbl 1351.68255
[63] Kirkpatrick, S., Optimization by simulated annealing: quantitative studies, J. Stat. Phys., 34, 5-6, 975-986 (1984)
[64] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 671-680 (1983) · Zbl 1225.90162
[65] Koopmans, T. C.; Beckmann, M. J., Assignment problems and the location of economic activities, Econometrica, 25, 53-76 (1957) · Zbl 0098.12203
[66] Liao, T.; Stützle, T.; de Oca, M. A.M.; Dorigo, M., A unified ant colony optimization algorithm for continuous optimization, Eur. J. Oper. Res., 234, 3, 597-609 (2014) · Zbl 1304.90221
[67] López-Ibáñez, M.; Dubois-Lacoste, J.; Cáceres, L. P.; Stützle, T.; Birattari, M., The irace package: iterated racing for automatic algorithm configuration, Oper. Res. Perspect., 3, 43-58 (2016)
[68] López-Ibáñez, M.; Dubois-Lacoste, J.; Stützle, T.; Birattari, M., The Irace Package, Iterated Race for Automatic Algorithm Configuration (2011), IRIDIA, Université Libre de Bruxelles, Belgium, Tech. Rep.
[69] López-Ibáñez, M.; Kessaci, M. E.; Stützle, T., Automatic Design of Hybrid Metaheuristics from Algorithmic Components (2017), IRIDIA, Université Libre de Bruxelles, Belgium, Tech. Rep.
[70] López-Ibáñez, M.; Stützle, T., The automatic design of multi-objective ant colony optimization algorithms, IEEE Trans. Evol. Comput., 16, 6, 861-875 (2012)
[71] López-Ibáñez, M.; Stützle, T., Automatically improving the anytime behaviour of optimisation algorithms, Eur. J. Oper. Res., 235, 3, 569-582 (2014) · Zbl 1401.90274
[72] Lundy, M.; Mees, A., Convergence of an annealing algorithm, Math. Program, 34, 1, 111-124 (1986) · Zbl 0581.90061
[73] Marmion, M. E.; Mascia, F.; López-Ibáñez, M.; Stützle, T., Automatic design of hybrid stochastic local search algorithms, (Blesa, M. J.; Blum, C.; Festa, P.; Roli, A.; Sampels, M., Hybrid Metaheuristics. Hybrid Metaheuristics, Lecture Notes in Computer Science, Vol. 7919 (2013), Springer: Springer Heidelberg, Germany), 144-158
[74] Mascia, F.; López-Ibáñez, M.; Dubois-Lacoste, J.; Stützle, T., From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness, (Pardalos, P. M.; Nicosia, G., Learning and Intelligent Optimization, 7th International Conference, LION 7. Learning and Intelligent Optimization, 7th International Conference, LION 7, Lecture Notes in Computer Science, Vol. 7997 (2013), Springer: Springer Heidelberg, Germany), 321-334
[75] Metropolis, N.; Rosenbluth, A. W.; Rosenbluth, M. N.; Teller, A.; Teller, E., Equation of state calculations by fast computing machines, J. Chem. Phys., 21, 1087-1092 (1953) · Zbl 1431.65006
[76] Misevičius, A., A modified simulated annealing algorithm for the quadratic assignment problem, Informatica, 14, 4, 497-514 (2003) · Zbl 1176.90665
[77] Mitra, D.; Romeo, F.; Sangiovanni-Vincentelli, A., Convergence and finite-time behavior of simulated annealing, Decision and Control, 1985 24th IEEE Conference on, 761-767 (1985), IEEE
[78] Moscato, P., 1989. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, caltech concurrent computation program. C3P Report 826, Caltech.; Moscato, P., 1989. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, caltech concurrent computation program. C3P Report 826, Caltech.
[79] Moscato, P.; Fontanari, J. F., Stochastic versus deterministic update in simulated annealing, Phys. Lett. A, 146, 4, 204-208 (1990)
[80] Nawaz, M.; Enscore, E.; Ham, I., A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem, Omega, 11, 1, 91-95 (1983)
[81] Nikolaev, A. G.; Jacobson, S. H., Simulated annealing, (Gendreau; Potvin, Handbook of Metaheuristics, 2nd ed (2010), Springer: Springer New York, NY), 1-39
[82] Ogbu, F. A.; Smith, D. K., The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem, Comput. Oper. Res., 17, 3, 243-253 (1990) · Zbl 0694.90059
[83] Orosz, J. E.; Jacobson, S. H., Analysis of static simulated annealing algorithms, J. Optim. Theory Appl., 115, 1, 165-182 (2002) · Zbl 1047.90078
[84] Osman, I. H.; Potts, C. N., Simulated annealing for permutation flow-shop scheduling, Omega, 17, 6, 551-557 (1989)
[85] Pagnozzi, F.; Stützle, T., Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (2018), IRIDIA, Université Libre de Bruxelles, Belgium, Tech. Rep.
[86] Pan, Q. K.; Ruiz, R., Local search methods for the flowshop scheduling problem with flowtime minimization, Eur. J. Oper. Res., 222, 1, 31-43 (2012) · Zbl 1253.90114
[87] Pan, Q. K.; Ruiz, R., A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Comput. Oper. Res., 40, 1, 117-128 (2013) · Zbl 1349.90386
[88] Paul, G., Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, Oper. Res. Lett., 38, 6, 577-581 (2010) · Zbl 1202.90176
[89] Paulli, J., A computational comparison of simulated annealing and tabu search applied to the quadratic assignment problem, (Vidal, R. V.V., Applied Simulated Annealing, 1993 (1993), Springer), 201-215
[90] Pinedo, M. L., Scheduling: Theory, Algorithms, and Systems (2012), Springer: Springer New York, NY · Zbl 1239.90002
[91] Pitzer, E.; Beham, A.; Affenzeller, M., Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis, European Conference on Evolutionary Computation in Combinatorial Optimization, 109-120 (2013), Springer
[92] Rechenberg, I., Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (1973), Frommann-Holzboog: Frommann-Holzboog Stuttgart, Germany
[93] Rose, J.; Klebsch, W.; Wolf, J., Temperature measurement and equilibrium dynamics of simulated annealing placements, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 9, 3, 253-259 (1990)
[94] Schwefel, H. P., Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie (1977), Birkhäuser: Birkhäuser Basel, Switzerland · Zbl 0347.65035
[95] Smith-Miles, K., Towards insightful algorithm selection for optimisation using meta-learning concepts, Neural Networks, 2008. IJCNN 2008.(IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on, 4118-4124 (2008), ieee
[96] Sörensen, K., Metaheuristics—the metaphor exposed, Int. Trans. Oper. Res., 22, 1, 3-18 (2015) · Zbl 1309.90127
[97] Sörensen, K.; Sevaux, M.; Glover, F., A history of metaheuristics, (Martí, R.; Pardalos, P. M.; Resende, M. G.C., Handbook of Heuristics (2018), Springer International Publishing), 1-18
[98] Souilah, A., Simulated annealing for manufacturing systems layout design, Eur. J. Oper. Res., 82, 3, 592-614 (1995) · Zbl 0905.90101
[99] Strenski, P. N.; Kirkpatrick, S., Analysis of finite length annealing schedules, Algorithmica, 6, 1-6, 346-366 (1991) · Zbl 0719.90094
[100] Stützle, T., Some thoughts on engineering stochastic local search algorithms, (Viana, A., Proceedings of the EU/MEeting 2009: Debating the Future: New Areas of Application and Innovative Approaches (2009)), 47-52
[101] Szu, H.; Hartley, R., Fast simulated annealing, Phys. Lett. A, 122, 3, 157-162 (1987)
[102] Taillard, E. D., Benchmarks for basic scheduling problems, Eur. J. Oper. Res., 64, 2, 278-285 (1993) · Zbl 0769.90052
[103] Taillard, E. D., Comparison of iterative searches for the quadratic assignment problem, Locat. Sci., 3, 2, 87-105 (1995) · Zbl 0916.90235
[104] Tam, K. Y., A simulated annealing algorithm for allocating space to manufacturing cells, Int. J. Prod. Res., 30, 1, 63-87 (1992) · Zbl 0825.90485
[105] Vallada, E.; Ruiz, R.; Framiñán, J. M., New hard benchmark for flowshop scheduling problems minimising makespan, Eur. J. Oper. Res., 240, 3, 666-677 (2015) · Zbl 1338.90185
[106] Weyland, D., A rigorous analysis of the harmony search algorithm: how the research community can be misled by a “novel” methodology, Int. J. Appl. Metaheuristic Comput., 12, 2, 50-60 (2010)
[107] Weyland, D., A critical analysis of the harmony search algorithm: how not to solve Sudoku, Oper. Res. Perspect., 2, 97-105 (2015)
[108] Wright, M. N.; Ziegler, A., Ranger: a fast implementation of random forests for high dimensional data in c++ and r, J. Stat. Softw., 77, 1, 1-17 (2017)
[109] Zilberstein, S., Using anytime algorithms in intelligent systems, AI Mag., 17, 3, 73-83 (1996)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.