The following pages link to Raymond Hemmecke (Q259720):
Displayed 50 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Reconstructing biochemical cluster networks (Q656982) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- A geometric view on learning Bayesian network structures (Q985149) (← links)
- On solving linear Diophantine systems using generalized Rosser's algorithm (Q1016753) (← links)
- On the Gröbner complexity of matrices (Q1017673) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- (Q1411617) (redirect page) (← links)
- Decomposition of test sets in stochastic integer programming (Q1411618) (← links)
- On the positive sums property and the computation of Graver test sets (Q1424269) (← links)
- Foundations of discrete optimization: in transition from linear to non-linear models and methods (Q1935328) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Decomposition of reaction networks: the initial phase of the permanganate/oxalic acid reaction (Q1959298) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Characteristic imsets for learning Bayesian network structure (Q2375330) (← links)
- Finiteness theorems in stochastic integer programming (Q2462619) (← links)
- A computational study of integer programming algorithms based on Barvinok's rational functions (Q2568332) (← links)
- Short rational functions for toric algebra and applications (Q2643547) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Migration Effects in Driven Multiple Pendula (Q2731088) (← links)
- (Q2762573) (← links)
- Polyhedral Approach to Statistical Learning Graphical Models (Q2812506) (← links)
- On the Connectivity of Fiber Graphs (Q2820007) (← links)
- (Q2896194) (← links)
- Pareto Optima of Multicriteria Integer Linear Programs (Q2901044) (← links)
- On the Circuit Diameter of Dual Transportation Polyhedra (Q3453568) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Three Counter-Examples on Semi-Graphoids (Q3512602) (← links)
- (Q3558639) (← links)
- Nonlinear Integer Programming (Q3565244) (← links)
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs (Q3569820) (← links)
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables (Q3581508) (← links)
- (Q3970766) (← links)
- (Q4452914) (← links)
- A decomposition algorithm applied to planning the interdiction of stochastic networks (Q4680427) (← links)
- (Q4790463) (← links)
- (Q4904855) (← links)
- Universal Gröbner Bases of Colored Partition Identities (Q4908505) (← links)
- Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics (Q4915371) (← links)
- Inequalities for the Number of Walks in Graphs (Q5194706) (← links)
- Integer Polynomial Optimization in Fixed Dimension (Q5387970) (← links)
- Representation of Sets of Lattice Points (Q5444284) (← links)
- Computation of Atomic Fibers of Z-Linear Maps (Q5499916) (← links)
- (Q5692690) (← links)