Fixed set search applied to the clique partitioning problem
From MaRDI portal
Publication:6112737
DOI10.1016/j.ejor.2023.01.044OpenAlexW4318204977MaRDI QIDQ6112737
Raka Jovanovic, Antonio P. Sanfilippo, Stefan Voß
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.01.044
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-phased local search approach for the clique partitioning problem
- Facets of the clique partitioning polytope
- Solving group technology problems via clique partitioning
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A cutting plane algorithm for a clustering problem
- Cliques and clustering: A combinatorial approach
- Heuristic concentration: Two stage solution construction
- Cluster analysis and mathematical programming
- Proposals for chunking and tabu search
- Solving the clique partitioning problem as a maximally diverse grouping problem
- Revisiting simulated annealing: a component-based analysis
- Flight gate scheduling with respect to a reference schedule
- Greedy randomized adaptive search procedures
- Optimising sum-of-squares measures for clustering multisets defined over a metric space
- 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
- Clustering of microarray data via clique partitioning
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- Fast Clustering Algorithms
- The clique partitioning problem: Facets and patching facets
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
