default search action
Raymond Hemmecke
Person information
- affiliation: Technical University Munich, Faculty of Mathematics
- affiliation: University of California, Davis
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j28]Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:
Quadratic diameter bounds for dual network flow polyhedra. Math. Program. 159(1-2): 237-251 (2016) - 2015
- [j27]Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:
On the Circuit Diameter of Dual Transportation Polyhedra. SIAM J. Discret. Math. 29(1): 113-121 (2015) - [j26]Jesús A. De Loera, Raymond Hemmecke, Jon Lee:
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. SIAM J. Optim. 25(4): 2494-2511 (2015) - 2014
- [j25]Raymond Hemmecke, Matthias Köppe
, Robert Weismantel:
Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Program. 145(1-2): 1-18 (2014) - 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 - [j24]Hanjo Täubig, Jeremias Weihmann, Sven Kosub
Inequalities for the Number of Walks in Graphs. Algorithmica 66(4): 804-828 (2013) - [j23]Raymond Hemmecke, Shmuel Onn
n-Fold integer programming in cubic time. Math. Program. 137(1-2): 325-341 (2013) - 2012
- [j22]Tristram Bogart
Universal Gröbner Bases of Colored Partition Identities. Exp. Math. 21(4): 395-401 (2012) - [j21]Raymond Hemmecke, Silvia Lindner, Milan Studený
Characteristic imsets for learning Bayesian network structure. Int. J. Approx. Reason. 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: 26-39 - 2011
- [j20]Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe:
Computation of atomic fibers of Z-linear maps. Contributions Discret. Math. 6(2) (2011) - [j19]Winfried Bruns, Raymond Hemmecke, Bogdan Ichim
Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics. Exp. Math. 20(1): 25-33 (2011) - [j18]Raymond Hemmecke, Shmuel Onn
A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126(1): 97-117 (2011) - [j17]Raymond Hemmecke, Shmuel Onn
N-fold integer programming and nonlinear multi-transshipment. Optim. Lett. 5(1): 13-25 (2011) - [i4]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
N-fold integer programming in cubic time. CoRR abs/1101.3267 (2011) - 2010
- [j16]Milan Studený
A geometric view on learning Bayesian network structures. Int. J. Approx. Reason. 51(5): 573-586 (2010) - [j15]Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindner, Milan Studený:
Efficient Algorithms for Conditional Independence Inference. J. Mach. Learn. Res. 11: 3453-3479 (2010) - [c3]Raymond Hemmecke, Matthias Köppe
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. IPCO 2010: 219-229 - [p1]Raymond Hemmecke, Matthias Köppe
Nonlinear Integer Programming. 50 Years of Integer Programming 2010: 561-618 - [i3]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 Discret. Math. 4(1) (2009) - [j13]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
Pareto Optima of Multicriteria Integer Linear Programs. INFORMS J. Comput. 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) - [i2]Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
Multicommodity Flow in Polynomial Time. CoRR abs/0906.5106 (2009) - 2008
- [j11]Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
Three Counter-Examples on Semi-Graphoids. Comb. Probab. Comput. 17(2): 239-257 (2008) - [j10]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn
N-fold integer programming. Discret. Optim. 5(2): 231-241 (2008) - [j9]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
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
Finiteness Theorems in Stochastic Integer Programming. Found. Comput. Math. 7(2): 183-227 (2007) - [j7]Raymond Hemmecke, Robert Weismantel:
Representation of Sets of Lattice Points. SIAM J. Optim. 18(1): 133-137 (2007) - 2006
- [j6]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
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 - [i1]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-Fold Integer Programming. CoRR abs/math/0605242 (2006) - 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. Discret. Optim. 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üdiger 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: