Raymond Hemmecke

36 papers A* 1B 2Journal 30Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
Quadratic diameter bounds for dual network flow polyhedra.
Math. Program.
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
2015 J jnl
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.
SIAM J. Optim.
Jesús A. De Loera, Raymond Hemmecke, Jon Lee
2015 J jnl
On the Circuit Diameter of Dual Transportation Polyhedra.
SIAM J. Discret. Math.
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
2014 J jnl
Graver basis and proximity techniques for block-structured separable convex integer minimization problems.
Math. Program.
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2013 — book
Algebraic and Geometric Ideas in the Theory of Discrete Optimization.
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
2013 J jnl
Inequalities for the Number of Walks in Graphs.
Algorithmica
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
2013 J jnl
n-Fold integer programming in cubic time.
Math. Program.
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
2012 J jnl
Characteristic imsets for learning Bayesian network structure.
Int. J. Approx. Reason.
Raymond Hemmecke, Silvia Lindner, Milan Studený
2012 — conf
Inequalities for the Number of Walks in Graphs.
ANALCO
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann
2011 J jnl
A polynomial oracle-time algorithm for convex integer minimization.
Math. Program.
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2011 J jnl
Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics.
Exp. Math.
Winfried Bruns, Raymond Hemmecke, Bogdan Ichim, Matthias Köppe, Christof Söger
2011 J jnl
Computation of atomic fibers of Z-linear maps.
Contributions Discret. Math.
Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe
2011 J jnl
N-fold integer programming in cubic time
CoRR
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
2010 B conf
A Polynomial-Time Algorithm for Optimizing over
IPCO
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2010 J jnl
A geometric view on learning Bayesian network structures.
Int. J. Approx. Reason.
Milan Studený, Jirí Vomlel, Raymond Hemmecke
2010 J jnl
Efficient Algorithms for Conditional Independence Inference.
J. Mach. Learn. Res.
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindner, Milan Studený
2010 J jnl
Learning restricted Bayesian network structures
CoRR
Raymond Hemmecke, Silvia Lindner, Milan Studený
2010 — ch.
Nonlinear Integer Programming.
50 Years of Integer Programming
Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel
2009 J jnl
Computing generating sets of lattice ideals and Markov bases of lattices.
J. Symb. Comput.
Raymond Hemmecke, Peter N. Malkin
2009 J jnl
Computing holes in semi-groups and its applications to transportation problems.
Contributions Discret. Math.
Raymond Hemmecke, Akimichi Takemura, Ruriko Yoshida
2009 J jnl
Multicommodity Flow in Polynomial Time.
CoRR
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2009 J jnl
Pareto Optima of Multicriteria Integer Linear Programs.
INFORMS J. Comput.
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
2008 J jnl
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program.
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2008 J jnl
N-fold integer programming.
Discret. Optim.
Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2008 J jnl
Three Counter-Examples on Semi-Graphoids.
Comb. Probab. Comput.
Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand
2007 J jnl
Finiteness Theorems in Stochastic Integer Programming.
Found. Comput. Math.
Matthias Aschenbrenner, Raymond Hemmecke
2007 J jnl
Representation of Sets of Lattice Points.
SIAM J. Optim.
Raymond Hemmecke, Robert Weismantel
2006 A* conf
FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
SODA
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2006 J jnl
Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res.
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2006 J jnl
N-Fold Integer Programming.
CoRR
Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2005 J jnl
A computational study of integer programming algorithms based on Barvinok's rational functions.
Discret. Optim.
Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida
2004 J jnl
Effective lattice point counting in rational convex polytopes.
J. Symb. Comput.
Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer, Ruriko Yoshida
2004 J jnl
Short rational functions for toric algebra and applications.
J. Symb. Comput.
Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Bernd Sturmfels, Ruriko Yoshida
2004 B conf
Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.
IPCO
Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida
2003 J jnl
Decomposition of test sets in stochastic integer programming.
Math. Program.
Raymond Hemmecke, Rüdiger Schultz
2003 J jnl
On the positive sum property and the computation of Graver test sets.
Math. Program.
Raymond Hemmecke