Self-tuning of the noising methods

DOI10.1080/02331930902944911MaRDI QIDQ3646090zbMATH OpenOpenAlexFDO

Authors Irène Charon, Olivier Hudry

Publication date 19 November 2009

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930902944911

zbMATH Keywords

automatic tuningcombinatorial optimizationmetaheuristicsnoising methodssimulated annealingthreshold accepting algorithms

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The noising methods: A generalization of some metaheuristics
• The noising methods: A survey
• Application of the noising method to the travelling salesman problem
• scientific article; zbMATH DE number 2222042
• scientific article; zbMATH DE number 1054957

Cites work

• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A modified noising algorithm for the graph partitioning problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• 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
• Handbook of metaheuristics
• Lamarckian genetic algorithms applied to the aggregation of preferences
• Metaheuristics for Hard Optimization
• Noising methods for a clique partitioning problem
• NP-hardness results for the aggregation of linear orders into median orders
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• The median procedure in cluster analysis and social choice theory
• The noising method: A new method for combinatorial optimization
• The noising methods: A generalization of some metaheuristics
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(10)

• Selftuning and its footprints
• Application of the noising method to the travelling salesman problem
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Noising methods for a clique partitioning problem
• The noising methods: A survey
• Filtering Techniques in Self-Tuning
• A survey on optimization metaheuristics
• Application of the ``descent with mutations metaheuristic to a clique partitioning problem
• The noising methods: A generalization of some metaheuristics
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Self-tuning of the noising methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646090)