Pages that link to "Item:Q2770188"
From MaRDI portal
The following pages link to A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188):
Displaying 31 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- (Q5425124) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- (Q5490818) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)
