Fixed set search applied to the clique partitioning problem

DOI10.1016/J.EJOR.2023.01.044MaRDI QIDQ6112737zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

clique partitioning problemfixed set searchGRASPmetaheuristicssimulated annealing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A cutting plane algorithm for a clustering problem
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
• A three-phased local search approach for the clique partitioning problem
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Cliques and clustering: A combinatorial approach
• Cluster analysis and mathematical programming
• Clustering of microarray data via clique partitioning
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• Facets of the clique partitioning polytope
• Fast Clustering Algorithms
• Flight gate scheduling with respect to a reference schedule
• Greedy randomized adaptive search procedures
• Heuristic concentration: Two stage solution construction
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1163723 (Why is no real title available?)
• scientific article; zbMATH DE number 1488088 (Why is no real title available?)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• New bounds and constraint propagation techniques for the clique partitioning problem
• Noising methods for a clique partitioning problem
• Optimising sum-of-squares measures for clustering multisets defined over a metric space
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• Proposals for chunking and tabu search
• Revisiting simulated annealing: a component-based analysis
• 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

Cited in

(6)

• A clique search problem and its application to machine scheduling
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
• An efficient iterated local search for the minimum quasi-clique partitioning problem
• Algorithms for the global domination problem
• Fixed set search matheuristic applied to the knapsack problem with forfeits

This page was built for publication: Fixed set search applied to the clique partitioning problem

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