Pages that link to "Item:Q1319044"

The following pages link to Node and edge relaxations of the max-cut problem (Q1319044):

Displaying 12 items.

• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• Path optimization for graph partitioning problems (Q1276954) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
• On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• On the Power of Nodes of Degree Four in the Local Max-Cut Problem (Q3563008) (← links)
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS (Q4446320) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)