The Branch and Cut Method for the Clique Partitioning Problem

DOI10.1134/S1990478919030153zbMath1438.90395OpenAlexW2970401994WikidataQ127311082 ScholiaQ127311082MaRDI QIDQ4973260

R. Yu. Simanchev, I. V. Urazova, Yury A. Kochetov

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919030153

zbMATH Keywords

local searchbranch-and-cut methodfacet inequality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The affine hull of the schedule polytope for servicing identical requests by parallel devices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for cluster editing: Evaluation and experiments
• Correlation clustering
• Facets of the clique partitioning polytope
• The \(p\)-median problem: a survey of metaheuristic approaches
• Facet identification for the symmetric traveling salesman polytope
• Complexity of local search for the \(p\)-median problem
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• NP-hard problems in hierarchical-tree clustering
• A cutting plane algorithm for a clustering problem
• Solving the clique partitioning problem as a maximally diverse grouping problem
• Cluster graph modification problems
• Competitive location in cognitive radio networks
• Clustering with qualitative information
• On the notion of balance of a signed graph
• A double VNS heuristic for the facility location and pricing problem
• Computational complexity of the graph approximation problem
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• On the polytope faces of the graph approximation problem
• The clique partitioning problem: Facets and patching facets
• On Linear Characterizations of Combinatorial Optimization Problems
• Approximating Symmetric Relations by Equivalence Relations
• Aggregating inconsistent information