A three-phased local search approach for the clique partitioning problem
From MaRDI portal
(Redirected from Publication:306093)
Recommendations
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Phased local search for the maximum clique problem
- A New Branch and Bound Algorithm for the Clique Partitioning Problem
- The branch and cut method for the clique partitioning problem
Cites work
- A cutting plane algorithm for a clustering problem
- A Gentle Introduction to Memetic Algorithms
- A hybrid metaheuristic method for the maximum diversity problem
- A memetic algorithm for the minimum sum coloring problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An efficient memetic algorithm for the graph partitioning problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Breakout local search for the quadratic assignment problem
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Facets of the clique partitioning polytope
- Fast Clustering Algorithms
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 3980481 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- Hybrid evolutionary algorithms for graph coloring
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Noising methods for a clique partitioning problem
- Optimization by simulated annealing
- Solving group technology problems via clique partitioning
- Solving the clique partitioning problem as a maximally diverse grouping problem
- The clique partitioning problem: Facets and patching facets
- The noising methods: A generalization of some metaheuristics
Cited in
(10)- Clustering data that are graph connected
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- The biclique partitioning polytope
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- Improving Simulated Annealing for Clique Partitioning Problems
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- Fixed set search applied to the clique partitioning problem
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
- Learning driven three-phase search for the maximum independent union of cliques problem
- An efficient iterated local search for the minimum quasi-clique partitioning problem
This page was built for publication: A three-phased local search approach for the clique partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306093)
