We provide a comprehensive overview of the literature of algorithmic approaches for
multiobjective mixed‐integer and integer linear optimization problems. More precisely, we …

In recent years, the discovery of new algorithms for dealing with polynomial equations,
coupled with their implementation on fast inexpensive computers, has sparked a minor …

Triangulations presents the first comprehensive treatment of the theory of secondary
polytopes and related topics. The text discusses the geometric structure behind the …

We construct Markov chain algorithms for sampling from discrete exponential families
conditional on a sufficient statistic. Examples include contingency tables, logistic regression …

Introduction. It is notoriously difficult to deduce anything about the structure of an ideal or
scheme by directly examining its defining polynomials. A notable exception is that of …

This paper considers the two-stage stochastic integer programming problem, with an
emphasis on instances in which integer variables appear in the second stage. Drawing …

It is undeniable that geometric ideas have been very important to the foundations of modern
discrete optimization. The influence that geometric algorithms have in optimization was …

We prove that for any fixed $ d $ the generating function of the projection of the set of integer
points in a rational $ d $-dimensional polytope can be computed in polynomial time. As a …

In this paper we present a framework for solving stochastic programs with complete integer
recourse and discretely distributed right-hand side vector, using Gröbner basis methods …

We study the problem of minimizing c· x subject to A· x= b. x≥ 0 and x integral, for a fixed
matrix A. Two cost functions c and c′ are considered equivalent if they give the same …