A two-level graph partitioning problem arising in mobile wireless communications
Open Access
- 18 November 2017
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 69 (3) , 653-676
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/H023151/1)
This publication has 33 references indexed in Scilit:
- Polyhedral combinatorics of the -partitioning problem with representative variablesDiscrete Applied Mathematics, 2016
- A cost function for similarity-based hierarchical clustering2016
- An Efficient Semidefinite Programming Relaxation for the Graph Partition ProblemINFORMS Journal on Computing, 2014
- Orbitopal fixingDiscrete Optimization, 2011
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010
- Symmetry in Integer Linear Programming2009
- A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problemAnnals of Operations Research, 2008
- Models and solution techniques for frequency assignment problemsAnnals of Operations Research, 2007
- The Semidefinite Relaxation of the k-Partition Polytope Is Strong2002
- The clique partitioning problem: Facets and patching facetsNetworks, 2001