Pages that link to "Item:Q1602704"
From MaRDI portal
The following pages link to Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704):
Displaying 39 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736) (← links)
- Stronger linear programming relaxations of max-cut (Q1403298) (← links)
- A tight semidefinite relaxation of the MAX CUT problem (Q1417849) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Geometry of semidefinite Max-Cut relaxations via matrix ranks (Q1610658) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- Strengthened semidefinite programming relaxations for the max-cut problem. (Q2768060) (← links)
- Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure (Q2784415) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS (Q4446320) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold (Q6596339) (← links)
