#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1999

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer, Ruriko Yoshida
- J. Symb. Comput.
- 2004

- Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Bernd Sturmfels, Ruriko Yoshida
- J. Symb. Comput.
- 2004

- Raymond Hemmecke, Peter N. Malkin
- J. Symb. Comput.
- 2009

- Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
- INFORMS Journal on Computing
- 2009

W settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct: (1) polynomial-time algorithms to determine exactly the number of Pareto optima and Pareto strategies; (2) a… (More)

- Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel
- 50 Years of Integer Programming
- 2010

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of… (More)

- Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
- MOS-SIAM Series on Optimization
- 2013

This book presents recent advances in the mathematical theory of discrete optimization, particularly those supported by methods from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside the standard curriculum in optimization. Algebraic and Geometric Ideas in the Theory of… (More)

- Raymond Hemmecke
- Math. Program.
- 2003

- Raymond Hemmecke, Rüdiger Schultz
- Math. Program.
- 2003

- Raymond Hemmecke
- 2003

In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by providing an explicit relationship to Graver bases. One candidate where this new approach may turn out fruitful is the… (More)

- Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida
- Discrete Optimization
- 2005

This paper discusses five algorithms to solve linear integer programming problems that use the rational function techniques introduced by A. Barvinok. We report on the first ever experimental results based on these techniques.