Application of the “descent with mutations” metaheuristic to a clique partitioning problem

DOI10.1051/ro/2018048zbMath1423.90277OpenAlexW2810523637MaRDI QIDQ5242283

Olivier Hudry

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018048

zbMATH Keywords

metaheuristicssimulated annealingnoising methodsaggregation of symmetric relations into median partitionsclique partitioning of a graphmedian equivalence relations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances

Cites Work

• NP-hard problems in hierarchical-tree clustering
• The median procedure in cluster analysis and social choice theory
• The noising method: A new method for combinatorial optimization
• Lamarckian genetic algorithms applied to the aggregation of preferences
• Application of the noising method to the travelling salesman problem
• Descent with mutations applied to the linear ordering problem
• Metaheuristics
• Cluster Analysis
• Self-tuning of the noising methods
• Approximating Symmetric Relations by Equivalence Relations
• NP-hardness of the computation of a median equivalence relation in classification (Régnier problem)
• Handbook of metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item