Noising methods for a clique partitioning problem

DOI10.1016/j.dam.2005.05.029zbMath1120.90063MaRDI QIDQ2489901

Irène Charon, Olivier Hudry

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.029

zbMATH Keywords

Classification; Clustering; Simulated annealing; Metaheuristics; Noising methods; Zahn's problem; Aggregation of relations; Clique partitioning of a weighted graph; Régnier's problem; Threshold accepting algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Solving Graph Partitioning Problems with Parallel Metaheuristics, The noising methods: A generalization of some metaheuristics, A three-phased local search approach for the clique partitioning problem, Automatic clustering using genetic algorithms, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, A tabu search approach for the minimum sum-of-squares clustering problem, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Solving the clique partitioning problem as a maximally diverse grouping problem, Lagrangian relaxation and pegging test for the clique partitioning problem, Self-tuning of the noising methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• 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
• Cluster analysis and mathematical programming
• Clustering of XML documents
• Application of the noising method to the travelling salesman problem
• Metaheuristics: A bibliography
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Self-tuning of the noising methods
• A modified noising algorithm for the graph partitioning problem
• Approximating Symmetric Relations by Equivalence Relations
• Handbook of metaheuristics