Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
DOI10.1016/J.ARTINT.2015.07.001zbMATH Open1404.68138OpenAlexW1440788545MaRDI QIDQ511772FDOQ511772
Matti Järvisalo, Jeremias Berg
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
Recommendations
correlation clusteringBoolean satisfiabilityconstrained clusteringBoolean optimizationmaximum satisfiabilitycost-optimal clustering
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Clustering with qualitative information
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Correlation clustering
- Itemset mining: a constraint programming perspective
- Iterative and core-guided maxsat solving: a survey and assessment
- QMaxSAT: A partial Max-SAT solver
- Improvements to Core-Guided Binary Search for MaxSAT
- SAT-Based Preprocessing for MaxSAT
- SAT-based MaxSAT algorithms
- Algorithms for Weighted Boolean Optimization
- On Solving the Partial MAX-SAT Problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- Open-WBO: A Modular MaxSAT Solver,
- Exploiting Cycle Structures in Max-SAT
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Aggregating inconsistent information
- Correlation clustering in general weighted graphs
- Blocked clause elimination
- Cluster graph modification problems
- Reconstructing solutions after blocked clause elimination
- NP-hard problems in hierarchical-tree clustering
- Title not available (Why is that?)
- Efficient CNF Simplification Based on Binary Implication Graphs
- Data Integration in the Life Sciences
- Correlation clustering with partial information
- On the approximation of correlation clustering and consensus clustering
- Clause elimination procedures for CNF formulas
- Formula Preprocessing in MUS Extraction
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- Towards Robust CNF Encodings of Cardinality Constraints
- Exploiting the Power of mip Solvers in maxsat
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
- Constrained Clustering Using Column Generation
- Algorithms and Computation
Cited In (3)
Uses Software
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)