Cones of multipowers and combinatorial optimization problems

DOI10.1134/S096554251305014XzbMath1299.90287MaRDI QIDQ5413066

Mikhail N. Vyalyi

Publication date: 28 April 2014

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization problemcones of multipowerstensor extensions of polyhedra

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Nonnegative polynomials and sums of squares
• ORBITOPES
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• On the power of unique 2-prover 1-round games
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
• Some optimal inapproximability results
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• The PCP theorem by gap amplification

This page was built for publication: Cones of multipowers and combinatorial optimization problems