Parallel local search
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3970026 (Why is no real title available?)
- scientific article; zbMATH DE number 4068238 (Why is no real title available?)
- scientific article; zbMATH DE number 18531 (Why is no real title available?)
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 53884 (Why is no real title available?)
- scientific article; zbMATH DE number 107465 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 724213 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1054958 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 278830 (Why is no real title available?)
- A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
- A complexity theory of efficient parallel algorithms
- A distributed implementation of simulated annealing for the travelling salesman problem
- A local search template.
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- A parallel tabu search algorithm for large traveling salesman problems
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- A theoretical framework for simulated annealing
- A user's guide to tabu search
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Bounding the probability of success of stochastic methods for global optimization
- Computer Solutions of the Traveling Salesman Problem
- Evolution algorithms in combinatorial optimization
- How easy is local search?
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
- Massively parallel tabu search for the quadratic assignment problem
- Optimization by simulated annealing
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Parallel iterative search methods for vehicle routing problems
- Parallel recombinative simulated annealing: A genetic algorithm
- Sequential and parallel local search for the time-constrained traveling salesman problem
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Slow annealing versus multiple fast annealing runs - an empirical investigation
- Some efficient heuristic methods for the flow shop sequencing problem
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Tabu Search—Part I
- The Parallel Evaluation of General Arithmetic Expressions
- The complexity of probabilistic verification
Cited in
(27)- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Asynchronous cooperative local search for the office-space-allocation problem
- An empirical investigation on parallelization strategies for scatter search
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Parallel constraint-based local search on the Cell/BE multicore architecture
- scientific article; zbMATH DE number 857591 (Why is no real title available?)
- Parallel Local Search in Comet
- A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems
- scientific article; zbMATH DE number 1884354 (Why is no real title available?)
- A review of literature on parallel constraint solving
- Parallel information algorithm with local tuning for solving multidimensional GO problems
- Theoretical properties of a neighborhood-based approach for widening
- Large-scale parallelism for constraint-based local search: the costas array case study
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
- Metaheuristics in combinatorial optimization
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Parallel and distributed local search in COMET
- Parallel solution methods for vehicle routing problems
- Local tuning and partition strategies for diagonal GO methods
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Metaheuristics: A bibliography
- scientific article; zbMATH DE number 2014723 (Why is no real title available?)
- Paroid search: Generic local combinatorial optimization
- Parallelization strategies for bee colony optimization based on message passing communication protocol
- TTT plots: a perl program to create time-to-target plots
This page was built for publication: Parallel local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922627)
