Compact mathematical formulation for graph partitioning
From MaRDI portal
Recommendations
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- scientific article; zbMATH DE number 3991298
- Linear and quadratic programming approaches for the general graph partitioning problem
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- An extended edge-representative formulation for the \(K\)-partitioning problem
Cited in
(13)- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- A strong formulation for the graph partition problem
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Symmetry in mathematical programming
- Linear and quadratic programming approaches for the general graph partitioning problem
- Compact linearization for binary quadratic problems subject to assignment constraints
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Compact linearization for binary quadratic problems
- Automatic Generation of Symmetry-Breaking Constraints
- Two new integer linear programming formulations for the vertex bisection problem
This page was built for publication: Compact mathematical formulation for graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959488)
