The noising methods: A generalization of some metaheuristics
From MaRDI portal
Publication:5954829
Recommendations
Cites work
- scientific article; zbMATH DE number 1188984 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1054925 (Why is no real title available?)
- scientific article; zbMATH DE number 1054949 (Why is no real title available?)
- scientific article; zbMATH DE number 1054957 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A hybrid heuristic to solve a task allocation problem
- A modified noising algorithm for the graph partitioning problem
- A tour construction heuristic for the travelling salesman problem
- Application of the noising method to the travelling salesman problem
- Clustering of XML documents
- Computer Solutions of the Traveling Salesman Problem
- General local search methods
- Lamarckian genetic algorithms applied to the aggregation of preferences
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Noising methods for a clique partitioning problem
- On the convergence of ``threshold accepting
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Self-tuning of the noising methods
- TSPLIB—A Traveling Salesman Problem Library
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- The noising method: A new method for combinatorial optimization
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(24)- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
- Variable neighborhood search for Google machine reassignment problem
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- New identifying codes in the binary Hamming space
- The noising methods: A survey
- A three-phased local search approach for the clique partitioning problem
- The noising method: A new method for combinatorial optimization
- Self-tuning of the noising methods
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- A survey on optimization metaheuristics
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A tabu search approach for the minimum sum-of-squares clustering problem
- Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
- An efficient local search with noising strategy for Google machine reassignment problem
- Tabu search when noise is present: An illustration in the context of cause and effect analysis
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
- Noising methods for a clique partitioning problem
- Solving probabilistic multi-facility Weber problem by vector quantization
- Application of the noising method to the travelling salesman problem
This page was built for publication: The noising methods: A generalization of some metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954829)
