Facets of the clique partitioning polytope

From MaRDI portal

Publication:752015

Jump to:navigation, search

DOI10.1007/BF01580870zbMath0715.90092OpenAlexW2047893320MaRDI QIDQ752015

Martin Grötschel, Yoshiko Wakabayashi

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580870

zbMATH Keywords

edge weighted graph clique partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

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, Multi-attribute community detection in international trade network, The partition problem, The clique partitioning problem: Facets and patching facets, A three-phased local search approach for the clique partitioning problem, An overview of graph covering and partitioning, Facets of the \(k\)-partition polytope, 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, Cluster analysis and mathematical programming, Solving the anti-covering location problem using Lagrangian relaxation, On the partial order polytope of a digraph, Improved Computational Approaches and Heuristics for Zero Forcing, The Boolean quadratic polytope: Some characteristics, facets and relatives, A cutting plane algorithm for a clustering problem, Solving group technology problems via clique partitioning, Size-constrained graph partitioning polytopes, The interval order polytope of a digraph, Efficient joint object matching via linear programming, Fractional programming formulation for the vertex coloring problem, A strong formulation for the graph partition problem, Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem, Improving heuristics for network modularity maximization using an exact algorithm, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Orbitopal fixing, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, Fixed set search applied to the clique partitioning problem, On Integrality in Semidefinite Programming for Discrete Optimization, Optimal solutions for the double row layout problem, Efficient enumeration of the optimal solutions to the correlation clustering problem, A polyhedral study of lifted multicuts, Detecting community structure: from parsimony to weighted parsimony, Community detection with the weighted parsimony criterion, New bounds and constraint propagation techniques for the clique partitioning problem, Facets from gadgets, Detecting critical node structures on graphs: A mathematical programming approach, Binary positive semidefinite matrices and associated integer polytopes, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Column generation bounds for numerical microaggregation, Reformulated acyclic partitioning for rail-rail containers transshipment, Facet-defining inequalities for the simple graph partitioning polytope, A two-level graph partitioning problem arising in mobile wireless communications, Conference scheduling: a clustering-based approach, Transitive packing, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Projection results for the \(k\)-partition problem, Facets for the cut cone. I, Clustering data that are graph connected, Disconnecting graphs by removing vertices: a polyhedral approach, A Lagrangian relaxation approach to the edge-weighted clique problem, Multiprocessor scheduling under precedence constraints: polyhedral results, A branch-and-cut algorithm for the partitioning-hub location-routing problem, Max-multiflow/min-multicut for G+H series-parallel, The biclique partitioning polytope, Good Clusterings Have Large Volume, The Branch and Cut Method for the Clique Partitioning Problem, Cliques and clustering: A combinatorial approach, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Formulations and valid inequalities of the node capacitated graph partitioning problem, Toward Optimal Community Detection: From Trees to General Weighted Networks, Exact algorithms for the minimum \(s\)-club partitioning problem, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Clustering of microarray data via clique partitioning, Lifting theorems and facet characterization for a class of clique partitioning inequalities, Political districting to minimize cut edges, Models for machine-part grouping in cellular manufacturing, Selected Topics in Critical Element Detection, Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering, Min-cut clustering

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:752015&oldid=12671274"