An exact approach for the multi-constraint graph partitioning problem
- 17 June 2020
- journal article
- research article
- Published by Elsevier BV in EURO Journal on Computational Optimization
- Vol. 8 (3-4), 289-308
- https://doi.org/10.1007/s13675-020-00126-9
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Semidefinite relaxations for partitioning, assignment and ordering problems4OR, 2012
- An exact algorithm for graph partitioningMathematical Programming, 2011
- Orbitopal fixingDiscrete Optimization, 2011
- Size-constrained graph partitioning polytopesDiscrete Mathematics, 2010
- Orbital branchingMathematical Programming, 2009
- Realignment in the National Football League: Did they do it right?Naval Research Logistics (NRL), 2003
- Parallel static and dynamic multi‐constraint graph partitioningConcurrency and Computation: Practice and Experience, 2002
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Semidefinite programming relaxations for the graph partitioning problemDiscrete Applied Mathematics, 1999
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976