Pages that link to "Item:Q4369893"
From MaRDI portal
The following pages link to Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q4369893):
Displaying 18 items.
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- A polynomial-time algorithm to find an equitable home--away assignment (Q1779696) (← links)
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities (Q2453122) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Stochastic Organization of Output Codes in Multiclass Learning Problems (Q2747211) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Efficient Rounding for the Noncommutative Grothendieck Inequality (Q3191601) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)