The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
From MaRDI portal
Publication:6092622
DOI10.1002/net.21944MaRDI QIDQ6092622
Publication date: 23 November 2023
Published in: Networks (Search for Journal in Brave)
integer programmingcombinatorial optimizationgraph partitioningbranch-and-cutextended formulationpolyhedral approach
Related Items (3)
An efficient heuristic for the \(k\)-partitioning problem ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions
Cites Work
- Unnamed Item
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- Orbitopal fixing
- Robust optimization of graph partitioning involving interval uncertainty
- Size-constrained graph partitioning polytopes
- Facets of the clique partitioning polytope
- Compact mathematical formulation for graph partitioning
- A cutting plane algorithm for a clustering problem
- Some simplified NP-complete graph problems
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- Cluster analysis and mathematical programming
- Graph partitioning using linear and semidefinite programming
- \(b\)-tree facets for the simple graph partitioning polytope
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Facets of the \(k\)-partition polytope
- Linear and quadratic programming approaches for the general graph partitioning problem
- The partition problem
- Facet-defining inequalities for the simple graph partitioning polytope
- On the asymmetric representatives formulation for the vertex coloring problem
- On the Solution of a Graph Partitioning Problem under Capacity Constraints
- On Finding Dense Subgraphs
- TSPLIB—A Traveling Salesman Problem Library
- Clique-Web Facets for Multicut Polytopes
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- The clique partitioning problem: Facets and patching facets
- On the cut polytope
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An Integer Programming Approach to Image Segmentation and Reconstruction Problems
This page was built for publication: The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>