Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
From MaRDI portal
Publication:5265177
DOI10.1007/978-3-642-38189-8_15zbMath1317.90301OpenAlexW2227764400MaRDI QIDQ5265177
Bissan Ghaddar, Lena Hupp, Angelika Wiegele, Miguel F. Anjos, Frauke Liers
Publication date: 22 July 2015
Published in: Facets of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38189-8_15
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 valid inequalities for the maximum \(k\)-cut problem, Exploiting sparsity for the min \(k\)-partition problem, A class of spectral bounds for max \(k\)-cut, Computational study of a branching algorithm for the maximum \(k\)-cut problem, Partitioning through projections: strong SDP bounds for large graph partition problems, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, A semidefinite relaxation based global algorithm for two-level graph partition problem, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, A branch-and-bound algorithm for solving max-\(k\)-cut problem, A framework for solving mixed-integer semidefinite programs, A two-level graph partitioning problem arising in mobile wireless communications, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials, Exact Solution Methods for the k-Item Quadratic Knapsack Problem, Spectral bounds for graph partitioning with prescribed partition sizes
Uses Software
