scientific article; zbMATH DE number 3991298

zbMATH Open0612.90101MaRDI QIDQ3753826FDOQ3753826

Authors: U. Faigle, R. Suletzki, Rainer Schrader 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• An exact algorithm for graph partitioning
• Algorithms for graph partitioning problems by means of eigenspace relaxations
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• A cutting plane algorithm for modularity maximization problem
• scientific article; zbMATH DE number 3891429

zbMATH Keywords

graph partitioninglinear relaxationcutting-plane algorithmfacet inducing inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (33)

• Facet-defining inequalities for the simple graph partitioning polytope
• Title not available (Why is that?)
• Title not available (Why is that?)
• An overview of graph covering and partitioning
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• A cutting plane algorithm for modularity maximization problem
• Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
• Multiset graph partitioning
• Generating partitions of a graph into a fixed number of minimum weight cuts
• Title not available (Why is that?)
• The branch and cut method for the clique partitioning problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• Cutting plane algorithms for solving a stochastic edge-partition problem
• An extended edge-representative formulation for the \(K\)-partitioning problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A cutting plane algorithm for a clustering problem
• A minimal surface criterion for graph partitioning
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
• Lifting theorems and facet characterization for a class of clique partitioning inequalities
• On the solution of a graph partitioning problem under capacity constraints
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• Compact mathematical formulation for graph partitioning
• An exact algorithm for graph partitioning
• Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
• Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• Linear and quadratic programming approaches for the general graph partitioning problem
• Partitioning graphs on message-passing machines by pairwise mincut

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753826)