Contribution of copositive formulations to graph partitioning problem

zbMATH Open1193.05134MaRDI QIDQ3575768FDOQ3575768

Authors: Janez Povh 

Publication date: 28 July 2010

Recommendations

• Contribution of copositive formulations to the graph partitioning problem
• A Copositive Programming Approach to Graph Partitioning
• An efficient semidefinite programming relaxation for the graph partition problem
• scientific article; zbMATH DE number 1182569
• Copositive matrices, copositive programming, and applications

zbMATH Keywords

copositive programmingsemidefinite relaxationgraph partitioning problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• The positive edge criterion within COIN-OR's CLP
• Contribution of copositive formulations to the graph partitioning problem
• A copositive formulation for the stability number of infinite graphs
• A Copositive Programming Approach to Graph Partitioning
• Algorithmic copositivity detection by simplicial partition

This page was built for publication: Contribution of copositive formulations to graph partitioning problem

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