Raymond Hemmecke

Affiliations:
  • Technical University Munich, Faculty of Mathematics
  • University of California, Davis


According to our database1, Raymond Hemmecke authored at least 35 papers between 2003 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Quadratic diameter bounds for dual network flow polyhedra.
Math. Program., 2016

2015
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.
SIAM J. Optim., 2015

On the Circuit Diameter of Dual Transportation Polyhedra.
SIAM J. Discret. Math., 2015

2014
Graver basis and proximity techniques for block-structured separable convex integer minimization problems.
Math. Program., 2014

2013
n-Fold integer programming in cubic time.
Math. Program., 2013

Inequalities for the Number of Walks in Graphs.
Algorithmica, 2013

Algebraic and Geometric Ideas in the Theory of Discrete Optimization.
MOS-SIAM Series on Optimization 14, SIAM, ISBN: 978-1-61197-243-6, 2013

2012
Characteristic imsets for learning Bayesian network structure.
Int. J. Approx. Reason., 2012

Universal Gröbner Bases of Colored Partition Identities.
Exp. Math., 2012

2011
<i>N</i>-fold integer programming and nonlinear multi-transshipment.
Optim. Lett., 2011

A polynomial oracle-time algorithm for convex integer minimization.
Math. Program., 2011

Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics.
Exp. Math., 2011

Computation of atomic fibers of Z-linear maps.
Contributions Discret. Math., 2011

2010
Efficient Algorithms for Conditional Independence Inference.
J. Mach. Learn. Res., 2010

A geometric view on learning Bayesian network structures.
Int. J. Approx. Reason., 2010

Learning restricted Bayesian network structures
CoRR, 2010

A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fold 4-Block Decomposable Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Nonlinear Integer Programming.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Computing generating sets of lattice ideals and Markov bases of lattices.
J. Symb. Comput., 2009

Pareto Optima of Multicriteria Integer Linear Programs.
INFORMS J. Comput., 2009

Multicommodity Flow in Polynomial Time.
CoRR, 2009

Computing holes in semi-groups and its applications to transportation problems.
Contributions Discret. Math., 2009

2008
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program., 2008

N-fold integer programming.
Discret. Optim., 2008

Three Counter-Examples on Semi-Graphoids.
Comb. Probab. Comput., 2008

2007
Representation of Sets of Lattice Points.
SIAM J. Optim., 2007

Finiteness Theorems in Stochastic Integer Programming.
Found. Comput. Math., 2007

2006
Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res., 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
A computational study of integer programming algorithms based on Barvinok's rational functions.
Discret. Optim., 2005

2004
Effective lattice point counting in rational convex polytopes.
J. Symb. Comput., 2004

Short rational functions for toric algebra and applications.
J. Symb. Comput., 2004

Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Decomposition of test sets in stochastic integer programming.
Math. Program., 2003

On the positive sum property and the computation of Graver test sets.
Math. Program., 2003


  Loading...