All Stories

  1. Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
  2. s-Lecture hall partitions, self-reciprocal polynomials, and Gorenstein cones
  3. The triangle closure is a polyhedron
  4. A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity
  5. Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case
  6. Algebraic and Geometric Ideas in the Theory of Discrete Optimization
  7. Unique Minimal Liftings for Simplicial Polytopes
  8. Rational Generating Functions and Integer Programming Games
  9. On the Complexity of Nonlinear Mixed-Integer Optimization
  10. A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
  11. Nonlinear Integer Programming
  12. Intermediate integer programming representations using value disjunctions
  13. Integrally indecomposable polytopes and the survivable network design problem
  14. A Primal Barvinok Algorithm Based on Irrational Decompositions
  15. Nondecomposable solutions to group equations and an application to polyhedral combinatorics
  16. Extended formulations for Gomory Corner polyhedra
  17. Cutting planes from a mixed integer Farkas lemma
  18. A Primal Approach to the Stable Set Problem
  19. On the Parameter Plane of Nonlinear Coupled Oscillators