Author:
Dewangan P. D.,Mande Praveen,Gupta Ankur,Krishna P. J.,Meena V. P.,Padhy A. P.,Singh V. P.
Reference10 articles.
1. Expected complexity analysis of stochastic direct-search
2. N. Goren, E. Fogel, and D. Halperin, “Area optimal polygonization using simulated annealing,” J. Exp. Algorithmics JEA, vol. 27, no. 2, pp. 1–17, 2022.
3. S. Chinnasamy, M. Ramachandran, M. Amudha, and K. Ramu, “A Review on Hill Climbing Optimization Methodology,” 2022.
4. An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
5. Comparing Multi-Objective Local Search Algorithms for the Beam Angle Selection Problem