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

DOI10.1007/BF01783411zbMath0784.90096OpenAlexW2330174148MaRDI QIDQ1803742

Michael Malmros Sørensen, Søren Holm

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

zbMATH Keywords

graph partitioningcombinatorial cuts

Mathematics Subject Classification ID

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

Related Items (6)

A branch-and-bound algorithm for the acyclic partitioning problem ⋮ Solving Graph Partitioning Problems Arising in Tagless Cache Management ⋮ Orbital branching ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ Improved compact formulations for a wide class of graph partitioning problems in sparse graphs ⋮ The node capacitated graph partitioning problem: A computational study

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• A projection technique for partitioning the nodes of a graph
• Combinatorial Solution to the Partitioning of General Graphs
• Facets of the knapsack polytope
• The Optimal Partitioning of Graphs

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