scientific article; zbMATH DE number 2086928

zbMATH Open1049.90136MaRDI QIDQ4737533FDOQ4737533

Authors: Andreas Eisenblätter 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370273.htm

Title of this publication is not available (Why is that?)

Recommendations

• Semidefinite programming relaxations for the graph partitioning problem
• An efficient semidefinite programming relaxation for the graph partition problem
• On semidefinite programming relaxations of maximum \(k\)-section
• On a positive semidefinite relaxation of the cut polytope
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• scientific article; zbMATH DE number 1285729
• Semidefinite programming and eigenvalue bounds for the graph partition problem
• Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
• scientific article; zbMATH DE number 2062976

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Semidefinite programming (90C22) Communication networks in operations research (90B18)

Cited In (20)

• Computational study of a branching algorithm for the maximum \(k\)-cut problem
• A framework for solving mixed-integer semidefinite programs
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• A two-level graph partitioning problem arising in mobile wireless communications
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
• A class of spectral bounds for max \(k\)-cut
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Complexity of the weighted max-cut in Euclidean space
• Graphs and algorithms in communication networks on seven league boots
• Projection results for the \(k\)-partition problem
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• Orbitopal fixing
• NP-hardness of the Euclidean Max-Cut problem
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Models and solution techniques for frequency assignment problems
• Assigning frequencies in GSM networks
• Exploiting sparsity for the min \(k\)-partition problem
• A semidefinite relaxation based global algorithm for two-level graph partition problem
• A multiple search operator heuristic for the max-k-cut problem
• Political districting to minimize cut edges

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737533)