scientific article; zbMATH DE number 2086928
From MaRDI portal
Publication:4737533
zbMath1049.90136MaRDI QIDQ4737533
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370273.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (19)
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 ⋮ A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem ⋮ Orbitopal fixing ⋮ 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 ⋮ A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem ⋮ NP-hardness of the Euclidean Max-Cut problem ⋮ 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 ⋮ A multiple search operator heuristic for the max-k-cut problem ⋮ Projection results for the \(k\)-partition problem ⋮ Models and solution techniques for frequency assignment problems ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Political districting to minimize cut edges ⋮ Complexity of the weighted max-cut in Euclidean space
This page was built for publication:
