Recommendations
Cites work
- 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 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3717087 (Why is no real title available?)
- scientific article; zbMATH DE number 3797446 (Why is no real title available?)
- A cutting plane algorithm for a clustering problem
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- Graph theory with applications
- On Linear Characterizations of Combinatorial Optimization Problems
- The median procedure in cluster analysis and social choice theory
Cited in
(84)- Multiprocessor scheduling under precedence constraints: polyhedral results
- Detecting community structure: from parsimony to weighted parsimony
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Facet-defining inequalities for the simple graph partitioning polytope
- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- The clique partitioning problem: Facets and patching facets
- A Lagrangian relaxation approach to the edge-weighted clique problem
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- Cliques and clustering: A combinatorial approach
- Facets of the \(k\)-partition polytope
- Community detection with the weighted parsimony criterion
- Clique facets of the axial and planar assignment polytopes
- The realization problem for tail correlation functions
- A strong formulation for the graph partition problem
- The partition problem
- A two-level graph partitioning problem arising in mobile wireless communications
- Models for machine-part grouping in cellular manufacturing
- A cutting plane algorithm for a clustering problem
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- On the partial order polytope of a digraph
- Cluster analysis and mathematical programming
- A Note on Clique-Web Facets for Multicut Polytopes
- scientific article; zbMATH DE number 15357 (Why is no real title available?)
- Improving heuristics for network modularity maximization using an exact algorithm
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- Clustering data that are graph connected
- Fractional programming formulation for the vertex coloring problem
- Orbitopal fixing
- Solving partitioning-hub location-routing problem using DCA
- Projection results for the \(k\)-partition problem
- The interval order polytope of a digraph
- Optimal solutions for the double row layout problem
- Redundant constraints in the standard formulation for the clique partitioning problem
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- Min-cut clustering
- Political districting to minimize cut edges
- Clustering of microarray data via clique partitioning
- Disconnecting graphs by removing vertices: a polyhedral approach
- A polyhedral study of lifted multicuts
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- A three-phased local search approach for the clique partitioning problem
- Binary positive semidefinite matrices and associated integer polytopes
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Selected topics in critical element detection
- Facets for the cut cone. I
- Solving group technology problems via clique partitioning
- Transitive packing
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Size-constrained graph partitioning polytopes
- Reformulated acyclic partitioning for rail-rail containers transshipment
- Column generation bounds for numerical microaggregation
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- A branch-and-bound algorithm for the acyclic partitioning problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Toward optimal community detection: from trees to general weighted networks
- Solving the anti-covering location problem using Lagrangian relaxation
- The corridor allocation problem
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes
- Flight gate assignment and recovery strategies with stochastic arrival and departure times
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Efficient joint object matching via linear programming
- Improved Computational Approaches and Heuristics for Zero Forcing
- Integer programming models and polyhedral study for the geodesic classification problem on graphs
- The biclique partitioning polytope
- An overview of graph covering and partitioning
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Fixed set search applied to the clique partitioning problem
- Exact algorithms for the minimum \(s\)-club partitioning problem
- The branch and cut method for the clique partitioning problem
- scientific article; zbMATH DE number 1286488 (Why is no real title available?)
- Facets from gadgets
- Max-multiflow/min-multicut for G+H series-parallel
- Detecting critical node structures on graphs: a mathematical programming approach
- Invariant correlation under marginal transforms
- Conference scheduling: a clustering-based approach
- Multi-attribute community detection in international trade network
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- On Integrality in Semidefinite Programming for Discrete Optimization
- Good clusterings have large volume
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
This page was built for publication: Facets of the clique partitioning polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752015)
