Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This is a survey of a recent methodology to solve systems of polynomial equations and inequalities for problems arising in combinatorial optimization. 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.