New bounds and constraint propagation techniques for the clique partitioning problem

DOI10.1016/J.DAM.2013.02.011MaRDI QIDQ2446845zbMATH OpenOpenAlexFDO

Authors Florian Jaehn, Erwin Pesch

Publication date 22 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.02.011

zbMATH Keywords

branch and boundclique partitioningconstraint propagation

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• scientific article; zbMATH DE number 7192822
• The branch and cut method for the clique partitioning problem
• Concise integer linear programming formulation for clique partitioning problems
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Cites work

• A cutting plane algorithm for a clustering problem
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Cliques and clustering: A combinatorial approach
• Clustering of microarray data via clique partitioning
• 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
• scientific article; zbMATH DE number 3833066 (Why is no real title available?)
• scientific article; zbMATH DE number 3980481 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Min-cut clustering
• On the complexity of partitioning graphs into connected subgraphs
• Solving group technology problems via clique partitioning
• The clique partitioning problem: Facets and patching facets
• The NP-Completeness of Edge-Coloring
• The Number of Partitions of a Set
• The partition problem

Cited in

(24)

• An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
• Reformulated acyclic partitioning for rail-rail containers transshipment
• Clustering data that are graph connected
• The biclique partitioning polytope
• A branch-and-price procedure for clustering data that are graph connected
• Concise integer linear programming formulation for clique partitioning problems
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry
• Lagrangian relaxation and pegging test for the clique partitioning problem
• Redundant constraints in the standard formulation for the clique partitioning problem
• Flight gate assignment and recovery strategies with stochastic arrival and departure times
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Balanced partition of a graph for football team realignment in Ecuador
• A three-phased local search approach for the clique partitioning problem
• A branch-and-bound algorithm for the acyclic partitioning problem
• Fast Clustering Algorithms
• scientific article; zbMATH DE number 7192822 (Why is no real title available?)
• The branch and cut method for the clique partitioning problem
• Improving Simulated Annealing for Clique Partitioning Problems
• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• Principles and Practice of Constraint Programming – CP 2004
• 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
• An efficient iterated local search for the minimum quasi-clique partitioning problem

This page was built for publication: New bounds and constraint propagation techniques for the clique partitioning problem

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