Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Raymond Hemmecke
Author information
- affiliation: Technical University Munich, Faculty of Mathematics
- affiliation: University of California, Davis
2010 – today
- 2013
[b1]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization 14, SIAM 2013, ISBN 978-1-61197-243-6, pp. I-XIX, 1-322- [j22]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk: n-Fold integer programming in cubic time. Math. Program. 137(1-2): 325-341 (2013)
- 2012
- [j21]Raymond Hemmecke, Silvia Lindner, Milan Studený: Characteristic imsets for learning Bayesian network structure. Int. J. Approx. Reasoning 53(9): 1336-1349 (2012)
- [c4]Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann: Inequalities for the Number of Walks in Graphs. ANALCO 2012: 28-39
- 2011
- [j20]Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe: Computation of atomic fibers of Z-linear maps. Contributions to Discrete Mathematics 6(2) (2011)
- [j19]Winfried Bruns, Raymond Hemmecke, Bogdan Ichim, Matthias Köppe, Christof Söger: Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics. Experimental Mathematics 20(1): 25-33 (2011)
- [j18]Raymond Hemmecke, Shmuel Onn, Robert Weismantel: A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126(1): 97-117 (2011)
- [j17]Raymond Hemmecke, Shmuel Onn, Robert Weismantel: N-fold integer programming and nonlinear multi-transshipment. Optimization Letters 5(1): 13-25 (2011)
- [i2]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk: N-fold integer programming in cubic time. CoRR abs/1101.3267 (2011)
- 2010
- [j16]Milan Studený, Jirí Vomlel, Raymond Hemmecke: A geometric view on learning Bayesian network structures. Int. J. Approx. Reasoning 51(5): 573-586 (2010)
- [j15]Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindner, Milan Studený: Efficient Algorithms for Conditional Independence Inference. Journal of Machine Learning Research 11: 3453-3479 (2010)
- [c3]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
- [i1]Raymond Hemmecke, Silvia Lindner, Milan Studený: Learning restricted Bayesian network structures. CoRR abs/1011.6664 (2010)
2000 – 2009
- 2009
- [j14]Raymond Hemmecke, Akimichi Takemura, Ruriko Yoshida: Computing holes in semi-groups and its applications to transportation problems. Contributions to Discrete Mathematics 4(1) (2009)
- [j13]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)
- [j12]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
- [j11]Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand: Three Counter-Examples on Semi-Graphoids. Combinatorics, Probability & Computing 17(2): 239-257 (2008)
- [j10]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel: N-fold integer programming. Discrete Optimization 5(2): 231-241 (2008)
- [j9]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
- [j8]Matthias Aschenbrenner, Raymond Hemmecke: Finiteness Theorems in Stochastic Integer Programming. Foundations of Computational Mathematics 7(2): 183-227 (2007)
- [j7]Raymond Hemmecke, Robert Weismantel: Representation of Sets of Lattice Points. SIAM Journal on Optimization 18(1): 133-137 (2007)
- 2006
- [j6]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)
- [c2]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
- 2005
- [j5]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
- [j4]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)
- [j3]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)
- [c1]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
- 2003
- [j2]Raymond Hemmecke, R. Schultz: Decomposition of test sets in stochastic integer programming. Math. Program. 94(2-3): 323-341 (2003)
- [j1]Raymond Hemmecke: On the positive sum property and the computation of Graver test sets. Math. Program. 96(2): 247-269 (2003)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 02:30 CEST by the dblp team