A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
SIAM Journal on Optimization
Cuts for Conic Mixed-Integer Programming
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Optimal Sherali-Adams Gaps from Pairwise Independence
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs
Discrete Applied Mathematics
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
A computational study on the quadratic knapsack problem with multiple constraints
Computers and Operations Research
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the rank of cutting-plane proof systems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
Tree-width and the Sherali-Adams operator
Discrete Optimization
Lift-and-project ranks and antiblocker duality
Operations Research Letters
0/1 polytopes with quadratic chvátal rank
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We consider the general nonlinear optimization problem in 0- 1 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of the former.