The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions. We are particularly interested in problems arising in combinatorial optimization.
CITATION STYLE
De Loera, J. A., Malkin, P. N., & Parrilo, P. A. (2012). Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (pp. 447–481). https://doi.org/10.1007/978-1-4614-1927-3_16
Mendeley helps you to discover research relevant for your work.