A three-phased local search approach for the clique partitioning problem
From MaRDI portal
Publication:306093
DOI10.1007/s10878-015-9964-9zbMath1354.90125OpenAlexW2298561559MaRDI QIDQ306093
F. Blanchet-Sadri, M. Dambrine
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9964-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem, Fixed set search applied to the clique partitioning problem, Clustering data that are graph connected, Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping, The biclique partitioning polytope
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A memetic algorithm for the minimum sum coloring problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Facets of the clique partitioning polytope
- An efficient memetic algorithm for the graph partitioning problem
- Solving group technology problems via clique partitioning
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A cutting plane algorithm for a clustering problem
- Solving the clique partitioning problem as a maximally diverse grouping problem
- Greedy randomized adaptive search procedures
- Hybrid evolutionary algorithms for graph coloring
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Breakout local search for the quadratic assignment problem
- A hybrid metaheuristic method for the maximum diversity problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Noising methods for a clique partitioning problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Fast Clustering Algorithms
- A Gentle Introduction to Memetic Algorithms
- The clique partitioning problem: Facets and patching facets
- The noising methods: A generalization of some metaheuristics
