ICMS 2018 - Session 4: Polyhedral methods in geometry and optimization


Aim and Scope

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 Groebner fans, which play major roles, e.g., in tropical geometry. 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:

Accepted Talks

© 2022. All rights reserved.