Compact mathematical formulation for graph partitioning
From MaRDI portal
Publication:959488
DOI10.1023/B:OPTE.0000038889.84284.c7zbMath1151.90522MaRDI QIDQ959488
Publication date: 11 December 2008
Published in: Optimization and Engineering (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (9)
Symmetry in Mathematical Programming ⋮ The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> ⋮ Linear and quadratic programming approaches for the general graph partitioning problem ⋮ A locally optimal hierarchical divisive heuristic for bipartite modularity maximization ⋮ Compact linearization for binary quadratic problems subject to assignment constraints ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ Compact linearization for binary quadratic problems ⋮ Automatic Generation of Symmetry-Breaking Constraints
Uses Software
This page was built for publication: Compact mathematical formulation for graph partitioning
