Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability

DOI10.1016/J.ARTINT.2015.07.001MaRDI QIDQ511772zbMATHOpenAlexFDO

Authors Jeremias Berg, Matti Järvisalo

Publication date 22 February 2017

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10138/185079

zbMATH Keywords

correlation clusteringBoolean satisfiabilityconstrained clusteringBoolean optimizationmaximum satisfiabilitycost-optimal clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Constrained clustering by constraint programming
• Correlation clustering with constrained cluster sizes and extended weights bounds
• Correlation Clustering
• Constrained Clustering Using Column Generation
• Clustering formulation using constraint optimization

Cites work

• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
• A parametric approach for smaller and better encodings of cardinality constraints
• Aggregating inconsistent information
• Algorithms and Computation
• Algorithms for Weighted Boolean Optimization
• An improved column generation algorithm for minimum sum-of-squares clustering
• Blocked clause elimination
• Clause elimination procedures for CNF formulas
• Cluster graph modification problems
• Clustering with qualitative information
• Constrained Clustering Using Column Generation
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• Correlation clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with a fixed number of clusters
• Correlation clustering with partial information
• Data Integration in the Life Sciences
• Efficient CNF simplification based on binary implication graphs
• Exploiting Cycle Structures in Max-SAT
• Exploiting the power of MIP solvers in MAXSAT
• Formula preprocessing in MUS extraction
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Improvements to core-guided binary search for MaxSAT
• Itemset mining: a constraint programming perspective
• Iterative and core-guided maxsat solving: a survey and assessment
• NP-hard problems in hierarchical-tree clustering
• On Solving the Partial MAX-SAT Problem
• On the approximation of correlation clustering and consensus clustering
• Open-WBO: a modular MaxSAT solver
• QMaxSAT: A partial Max-SAT solver
• Reconstructing solutions after blocked clause elimination
• SAT-based MaxSAT algorithms
• SAT-based preprocessing for MaxSAT
• Theory and Applications of Satisfiability Testing
• Towards Robust CNF Encodings of Cardinality Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(3)

• Constrained clustering: current and new trends
• Metric-Constrained Optimization for Graph Clustering Algorithms
• Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks

Describes a project that uses

Uses Software

• MiniSat
• SCIP
• SeDuMi
• QMaxSAT
• Open-WBO
• Coprocessor
• MaxHS

This page was built for publication: Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability

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