A two-level graph partitioning problem arising in mobile wireless communications
From MaRDI portal
Publication:1744904
DOI10.1007/s10589-017-9967-9zbMath1397.90325arXiv1705.08773OpenAlexW2617844366WikidataQ59612651 ScholiaQ59612651MaRDI QIDQ1744904
Adam N. Letchford, Jamie Fairbrother, Keith M. Briggs
Publication date: 20 April 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08773
Related Items
An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment, Computational study of a branching algorithm for the maximum \(k\)-cut problem, A new global algorithm for max-cut problem with chordal sparsity, A semidefinite relaxation based global algorithm for two-level graph partition problem, An exact approach for the multi-constraint graph partitioning problem, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- Orbitopal fixing
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Facets of the clique partitioning polytope
- A cutting plane algorithm for a clustering problem
- Geometric algorithms and combinatorial optimization
- Set packing relaxations of some integer programs
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Projection results for the \(k\)-partition problem
- Why should biconnected components be identified first
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Facets of the \(k\)-partition polytope
- The partition problem
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
- Engineering Multilevel Graph Partitioning Algorithms
- Symmetry in Integer Linear Programming
- Clique-Web Facets for Multicut Polytopes
- The clique partitioning problem: Facets and patching facets
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
- A cost function for similarity-based hierarchical clustering
- Scheduling to Minimize Interaction Cost
- An inequality for the chromatic number of a graph
- Algorithm 457: finding all cliques of an undirected graph
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Models and solution techniques for frequency assignment problems
- On cliques in graphs
- On disjunctive cuts for combinatorial optimization
