Facets of the clique partitioning polytope
From MaRDI portal
Publication:752015
DOI10.1007/BF01580870zbMath0715.90092MaRDI QIDQ752015
Martin Grötschel, Yoshiko Wakabayashi
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The clique partitioning problem: Facets and patching facets, Selected Topics in Critical Element Detection, Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering, Disconnecting graphs by removing vertices: a polyhedral approach, A Lagrangian relaxation approach to the edge-weighted clique problem, A three-phased local search approach for the clique partitioning problem, An extended edge-representative formulation for the \(K\)-partitioning problem, Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables, A branch-and-bound algorithm for the acyclic partitioning problem, The corridor allocation problem, Fractional programming formulation for the vertex coloring problem, Improving heuristics for network modularity maximization using an exact algorithm, Orbitopal fixing, Column generation bounds for numerical microaggregation, Size-constrained graph partitioning polytopes, Binary positive semidefinite matrices and associated integer polytopes, A branch-and-cut algorithm for the partitioning-hub location-routing problem, Solving group technology problems via clique partitioning, Community detection with the weighted parsimony criterion, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, The Boolean quadratic polytope: Some characteristics, facets and relatives, A cutting plane algorithm for a clustering problem, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Facets for the cut cone. I, Cliques and clustering: A combinatorial approach, Lifting theorems and facet characterization for a class of clique partitioning inequalities, Min-cut clustering, Cluster analysis and mathematical programming, Solving the anti-covering location problem using Lagrangian relaxation, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Formulations and valid inequalities of the node capacitated graph partitioning problem, Facets of the \(k\)-partition polytope, On the partial order polytope of a digraph, Optimal solutions for the double row layout problem, Max-multiflow/min-multicut for G+H series-parallel, Solving partitioning-hub location-routing problem using DCA, Flight gate assignment and recovery strategies with stochastic arrival and departure times, The realization problem for tail correlation functions, The partition problem, Detecting community structure: from parsimony to weighted parsimony, New bounds and constraint propagation techniques for the clique partitioning problem, Facet-defining inequalities for the simple graph partitioning polytope, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Multiprocessor scheduling under precedence constraints: polyhedral results, Clustering of microarray data via clique partitioning, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, Models for machine-part grouping in cellular manufacturing
Cites Work
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- A cutting plane algorithm for a clustering problem
- The median procedure in cluster analysis and social choice theory
- On Linear Characterizations of Combinatorial Optimization Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
