The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts

DOI10.1007/BF01783411zbMATH Open0784.90096OpenAlexW2330174148MaRDI QIDQ1803742FDOQ1803742

Authors: Søren Holm, Michael Malmros Sørensen 

Publication date: 29 June 1993

Published in: OR Spektrum (Search for Journal in Brave)

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

Recommendations

• The node capacitated graph partitioning problem: A computational study
• scientific article; zbMATH DE number 3991298
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
• On the solution of a graph partitioning problem under capacity constraints

zbMATH Keywords

graph partitioningcombinatorial cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Cites Work

• Facets of the knapsack polytope
• Title not available (Why is that?)
• Title not available (Why is that?)
• A projection technique for partitioning the nodes of a graph
• Combinatorial Solution to the Partitioning of General Graphs
• The Optimal Partitioning of Graphs

Cited In (11)

• Reformulated acyclic partitioning for rail-rail containers transshipment
• Solving graph partitioning problems arising in tagless cache management
• Orbital branching
• Title not available (Why is that?)
• A branch-and-bound algorithm for the acyclic partitioning problem
• An exact approach for the multi-constraint graph partitioning problem
• The node capacitated graph partitioning problem: A computational study
• On the solution of a graph partitioning problem under capacity constraints
• Compact mathematical formulation for graph partitioning
• Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
• A complementary column generation approach for the graph equipartition problem

Uses Software

• XMP

This page was built for publication: The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts

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