 | 2011 |
| 21 |  | Raymond Hemmecke,
Shmuel Onn,
Lyubov Romanchuk:
N-fold integer programming in cubic time
CoRR abs/1101.3267: (2011) |
| 20 |  | Raymond Hemmecke,
Shmuel Onn,
Robert Weismantel:
A polynomial oracle-time algorithm for convex integer minimization.
Math. Program. 126(1): 97-117 (2011) |
| 19 |  | Raymond Hemmecke,
Shmuel Onn,
Robert Weismantel:
N-fold integer programming and nonlinear multi-transshipment.
Optimization Letters 5(1): 13-25 (2011) |
| 2010 |
| 18 |  | Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs.
IPCO 2010: 219-229 |
| 17 |  | Raymond Hemmecke,
Silvia Lindner,
Milan Studený:
Learning restricted Bayesian network structures
CoRR abs/1011.6664: (2010) |
| 16 |  | Milan Studený,
Jirí Vomlel,
Raymond Hemmecke:
A geometric view on learning Bayesian network structures.
Int. J. Approx. Reasoning 51(5): 573-586 (2010) |
| 15 |  | Remco R. Bouckaert,
Raymond Hemmecke,
Silvia Lindner,
Milan Studený:
Efficient Algorithms for Conditional Independence Inference.
Journal of Machine Learning Research 11: 3453-3479 (2010) |
| 2009 |
| 14 |  | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe:
Pareto Optima of Multicriteria Integer Linear Programs.
INFORMS Journal on Computing 21(1): 39-48 (2009) |
| 13 |  | Raymond Hemmecke,
Peter N. Malkin:
Computing generating sets of lattice ideals and Markov bases of lattices.
J. Symb. Comput. 44(10): 1463-1476 (2009) |
| 2008 |
| 12 |  | Raymond Hemmecke,
Jason Morton,
Anne Shiu,
Bernd Sturmfels,
Oliver Wienand:
Three Counter-Examples on Semi-Graphoids.
Combinatorics, Probability & Computing 17(2): 239-257 (2008) |
| 11 |  | Jesús A. De Loera,
Raymond Hemmecke,
Shmuel Onn,
Robert Weismantel:
N-fold integer programming.
Discrete Optimization 5(2): 231-241 (2008) |
| 10 |  | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program. 115(2): 273-290 (2008) |
| 2007 |
| 9 |  | Matthias Aschenbrenner,
Raymond Hemmecke:
Finiteness Theorems in Stochastic Integer Programming.
Foundations of Computational Mathematics 7(2): 183-227 (2007) |
| 8 |  | Raymond Hemmecke,
Robert Weismantel:
Representation of Sets of Lattice Points.
SIAM Journal on Optimization 18(1): 133-137 (2007) |
| 2006 |
| 7 |  | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
SODA 2006: 743-748 |
| 6 |  | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res. 31(1): 147-153 (2006) |
| 2005 |
| 5 |  | Jesús A. De Loera,
David Haws,
Raymond Hemmecke,
Peter Huggins,
Ruriko Yoshida:
A computational study of integer programming algorithms based on Barvinok's rational functions.
Discrete Optimization 2(2): 135-144 (2005) |
| 2004 |
| 4 |  | Jesús A. De Loera,
David Haws,
Raymond Hemmecke,
Peter Huggins,
Ruriko Yoshida:
Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.
IPCO 2004: 244-255 |
| 3 |  | Jesús A. De Loera,
David Haws,
Raymond Hemmecke,
Peter Huggins,
Bernd Sturmfels,
Ruriko Yoshida:
Short rational functions for toric algebra and applications.
J. Symb. Comput. 38(2): 959-973 (2004) |
| 2 |  | Jesús A. De Loera,
Raymond Hemmecke,
Jeremiah Tauzer,
Ruriko Yoshida:
Effective lattice point counting in rational convex polytopes.
J. Symb. Comput. 38(4): 1273-1302 (2004) |
| 2003 |
| 1 |  | Raymond Hemmecke:
On the positive sum property and the computation of Graver test sets.
Math. Program. 96(2): 247-269 (2003) |