Pages that link to "Item:Q1319025"

The following pages link to Laplacian eigenvalues and the maximum cut problem (Q1319025):

Displaying 21 items.

• New quadratic models for the maximum weighted cut problem (Q2501328) (← links)
• Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Are Stable Instances Easy? (Q2911066) (← links)
• On Khot’s unique games conjecture (Q3109809) (← links)
• Spectral bounds for the maximum cut problem (Q3632965) (← links)
• SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• Sherali-adams strikes back (Q5091758) (← links)
• Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
• (Q5158503) (← links)
• Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)