Pages that link to "Item:Q2475315"
From MaRDI portal
The following pages link to Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315):
Displaying 9 items.
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Robust solutions of uncertain complex-valued quadratically constrained programs (Q2519336) (← links)
- (Q2751323) (← links)
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422) (← links)
- Algorithms – ESA 2005 (Q5475891) (← links)
