ICMS 2016 Session: Polyhedral Methods in Geometry and Optimization

ICMS 2016: Home, Sessions


Aim and Scope

Polyhedra occur in many contexts in geometry and optimization. For example, convex polyhedra occur in optimization as the feasible regions of linear programs. Moreover, integer linear programming is the same as linear programming over the convex hull of the lattice points in a polyhedron. In algebraic geometry and its applications, piecewise-linear shapes occur in the guise of polyhedral fans. Examples include secondary and Gröbner fans. This session wants to bring together people working on algorithms and software dealing with any of the above.

Specific topics include, but are not restricted to, the following:


Tuesday, 12:
Wednesday, 13:
Thursday, 14:

Confirmed Talks