Problems in computational algebra and integer programming

Abstract

This thesis is a compendium of several projects that span the gap between commutative algebra and geometric combinatorics: one in tropical geometry, one in computational algebra, and two in discrete geometry and integer programming. Key tools used in this thesis include the theory of polyhedra, Grobner bases, and computational complexity theory.