Polyhedra related to integer-convex polynomial systems

DOI10.1007/s10107-005-0650-zzbMath1081.90042OpenAlexW2080504759MaRDI QIDQ2583123

Dennis Michaels, Robert Weismantel

Publication date: 13 January 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0650-z

zbMATH Keywords

PolyhedraInteger polynomial programmingInteger-convex polynomialsPolynomial functions

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)

Related Items

Unbounded convex sets for non-convex mixed-integer quadratic programming

Cites Work

• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Global Optimization with Polynomials and the Problem of Moments
• Polynomials nonnegative on a grid and discrete optimization
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Jointly Constrained Biconvex Programming
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item