Concise integer linear programming formulation for clique partitioning problems

DOI10.1007/s10601-022-09326-zzbMath1495.90225OpenAlexW4224278119MaRDI QIDQ2152278

Yuko Sakurai, Emi Watanabe, Makoto Yokoo, Miyuki Koshimura

Publication date: 7 July 2022

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-022-09326-z

zbMATH Keywords

integer linear programmingclique partitioning problemtransitivity constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Cites Work

• MILP formulations for the modularity density maximization problem
• Correlation clustering
• Solving group technology problems via clique partitioning
• Coalition structure generation: a survey
• A cutting plane algorithm for a clustering problem
• Clustering data that are graph connected
• Coalition structure generation for partition function games utilizing a concise graphical representation
• Redundant constraints in the standard formulation for the clique partitioning problem
• Improved WPM encoding for coalition structure generation under MC-nets
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
• The clique partitioning problem: Facets and patching facets
• Toward Optimal Community Detection: From Trees to General Weighted Networks

This page was built for publication: Concise integer linear programming formulation for clique partitioning problems