Noising methods for a clique partitioning problem

DOI10.1016/J.DAM.2005.05.029zbMATH Open1120.90063OpenAlexW2031558242MaRDI QIDQ2489901FDOQ2489901

Olivier Hudry, Irène Charon

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

ClassificationClusteringSimulated annealingMetaheuristicsZahn's problemAggregation of relationsClique partitioning of a weighted graphNoising methodsThreshold accepting algorithmsRégnier's problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The median procedure in cluster analysis and social choice theory
• Cluster analysis and mathematical programming
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Handbook of metaheuristics
• Metaheuristics: A bibliography
• The complexity of computing medians of relations.
• NP-hard problems in hierarchical-tree clustering
• The noising method: A new method for combinatorial optimization
• The noising methods: A survey
• Self-tuning of the noising methods
• Application of the noising method to the travelling salesman problem
• Clustering of XML documents
• Approximating Symmetric Relations by Equivalence Relations
• A modified noising algorithm for the graph partitioning problem

Cited In (16)

• Automatic clustering using genetic algorithms
• Solving Graph Partitioning Problems with Parallel Metaheuristics
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• A three-phased local search approach for the clique partitioning problem
• Self-tuning of the noising methods
• The noising method: A new method for combinatorial optimization
• The biclique partitioning polytope
• The noising methods: A generalization of some metaheuristics
• Fixed set search applied to the clique partitioning problem
• Lagrangian relaxation and pegging test for the clique partitioning problem
• 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
• A branch-and-price procedure for clustering data that are graph connected
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem

This page was built for publication: Noising methods for a clique partitioning problem

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