• Parallel metaheuristic is a class of techniques that are capable of reducing both the numerical effort[clarification needed] and the run time of a metaheuristic...
    14 KB (1,829 words) - 17:11, 1 January 2025
  • algorithms. A parallel metaheuristic is one that uses the techniques of parallel programming to run multiple metaheuristic searches in parallel; these may...
    48 KB (4,646 words) - 00:34, 24 June 2025
  • Thumbnail for Swarm intelligence
    Swarm intelligence (category Nature-inspired metaheuristics)
    nature-inspired metaheuristics. This list includes algorithms published up to circa the year 2000. A large number of more recent metaphor-inspired metaheuristics have...
    46 KB (5,058 words) - 20:20, 31 July 2025
  • Thumbnail for Enrique Alba
    bioinformatics among others. The main focus of all his work is on parallel metaheuristics (high-performance computing in general) and multiobjective optimization...
    9 KB (866 words) - 15:15, 18 October 2024
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    39 KB (5,600 words) - 19:08, 15 July 2025
  • Thumbnail for Ant colony optimization algorithms
    Ant colony optimization algorithms (category Nature-inspired metaheuristics)
    algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD...
    77 KB (9,484 words) - 10:31, 27 May 2025
  • Thumbnail for Genetic algorithm
    computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger...
    69 KB (8,221 words) - 21:33, 24 May 2025
  • Thumbnail for Mathematical optimization
    infinite-dimensional space, such as a space of functions. Heuristics and metaheuristics make few or no assumptions about the problem being optimized. Usually...
    53 KB (6,165 words) - 14:19, 9 August 2025
  • Thumbnail for Combinatorial optimization
    discrete items; therefore, in principle, any sort of search algorithm or metaheuristic can be used to solve them. Widely applicable approaches include branch-and-bound...
    18 KB (1,848 words) - 18:11, 9 August 2025
  • if it is known that there is noise, the evaluations are being done in parallel, the quality of evaluations relies upon a tradeoff between difficulty and...
    21 KB (2,323 words) - 09:25, 4 August 2025
  • 2012. Bader, David A.; Hart, William E.; Phillips, Cynthia A. (2004). "Parallel Algorithm Design for Branch and Bound" (PDF). In Greenberg, H. J. (ed.)...
    20 KB (2,414 words) - 17:47, 9 August 2025
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    30 KB (3,146 words) - 11:17, 22 June 2025
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    11 KB (1,480 words) - 11:39, 15 August 2024
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    42 KB (6,261 words) - 00:52, 18 July 2025
  • Tabu search (category Metaheuristics)
    Tabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization. It was created by Fred W. Glover...
    15 KB (2,010 words) - 08:40, 6 August 2025
  • Thumbnail for Linear programming
    Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    61 KB (6,690 words) - 21:36, 9 August 2025
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    2 KB (174 words) - 15:49, 12 July 2024
  • Thumbnail for Newton's method
    Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    71 KB (9,136 words) - 10:06, 10 July 2025
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    2 KB (271 words) - 10:54, 25 April 2023
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    5 KB (759 words) - 07:39, 13 December 2024
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    6 KB (871 words) - 06:32, 19 July 2025
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    13 KB (1,844 words) - 01:05, 24 May 2025
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    22 KB (3,211 words) - 07:50, 26 April 2024
  • Thumbnail for Interior-point method
    Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    30 KB (4,691 words) - 00:20, 20 June 2025
  • Thumbnail for Hill climbing
    Hill climbing (category Metaheuristics)
    Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics (PDF). Kassel University Press. ISBN 978-3-7376-0459-8. Hill climbing...
    12 KB (1,605 words) - 05:35, 6 August 2025
  • Ford–Fulkerson Push–relabel maximum flow Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization...
    5 KB (596 words) - 22:00, 9 September 2024
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    30 KB (4,226 words) - 01:54, 24 June 2025
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    8 KB (1,360 words) - 06:43, 28 August 2024
  • neighborhood search (VNS), proposed by Mladenović & Hansen in 1997, is a metaheuristic method for solving a set of combinatorial optimization and global optimization...
    25 KB (3,224 words) - 13:05, 30 April 2025
  • Metaheuristics Evolutionary algorithm Hill climbing Local search Parallel metaheuristics Simulated annealing Spiral optimization algorithm Tabu search...
    7 KB (1,104 words) - 16:51, 18 January 2025