Robert Hildebrand
Title
Cited by
Cited by
Year
A -Slope Theorem for the -Dimensional Infinite Group Relaxation
A Basu, R Hildebrand, M Koppe, M Molinaro
SIAM Journal on Optimization 23 (2), 1021-1040, 2013
372013
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O (nlogn)
R Hildebrand, M Köppe
Discrete Optimization 10 (1), 69-84, 2013
342013
Equivariant perturbation in Gomory and Johnson's infinite group problem. I. The one-dimensional case
A Basu, R Hildebrand, M Köppe
Mathematics of Operations Research 40 (1), 105-129, 2015
24*2015
Light on the infinite group relaxation I: foundations and taxonomy
A Basu, R Hildebrand, M Köppe
4OR 14 (1), 1-40, 2016
232016
Equivariant perturbation in Gomory and Johnson's infinite group problem. I. The one-dimensional case
A Basu, R Hildebrand, M Köppe
Mathematics of Operations Research 40 (1), 105-129, 2015
232015
Equivariant perturbation in Gomory and Johnson’s infinite group problem—III: foundations for the k-dimensional case with applications to $$$$
A Basu, R Hildebrand, M Köppe
Mathematical Programming 163 (1-2), 301-358, 2017
222017
Equivariant perturbation in Gomory and Johnson’s infinite group problem—III: foundations for the k-dimensional case with applications to $$$$
A Basu, R Hildebrand, M Köppe
Mathematical Programming 163 (1-2), 301-358, 2017
222017
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
J Bader, R Hildebrand, R Weismantel, R Zenklusen
Mathematical Programming 169 (2), 565-584, 2018
162018
Minimizing cubic and homogeneous polynomials over integers in the plane
A Del Pia, R Hildebrand, R Weismantel, K Zemmer
Mathematics of Operations Research 41 (2), 511-530, 2016
142016
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms
A Basu, R Hildebrand, M Köppe
4OR 14 (2), 107-131, 2016
132016
An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
R Hildebrand, R Weismantel, K Zemmer
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
122016
The triangle closure is a polyhedron
A Basu, R Hildebrand, M Köppe
Mathematical Programming 145 (1-2), 19-58, 2014
122014
Extension complexity lower bounds for mixed-integer extended formulations
R Hildebrand, R Weismantel, R Zenklusen
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
102017
Minimal cut-generating functions are nearly extreme
A Basu, R Hildebrand, M Molinaro
Mathematical Programming 172 (1-2), 329-349, 2018
92018
Equivariant perturbation in Gomory and Johnson’s Infinite Group Problem: II. The unimodular two-dimensional case
A Basu, R Hildebrand, M Köppe
International Conference on Integer Programming and Combinatorial …, 2013
72013
Equivariant perturbation in Gomory and Johnson’s Infinite Group Problem: II. The unimodular two-dimensional case
A Basu, R Hildebrand, M Köppe
International Conference on Integer Programming and Combinatorial …, 2013
72013
Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
SR Chestnut, R Hildebrand, R Zenklusen
SIAM Journal on Discrete Mathematics 32 (1), 352-371, 2018
62018
Algorithmic and complexity results for cutting planes derived from maximal lattice-free convex sets
A Basu, R Hildebrand, M Köppe
arXiv preprint arXiv:1107.5068, 2011
52011
Note on the complexity of the mixed-integer hull of a polyhedron
R Hildebrand, T Oertel, R Weismantel
Operations Research Letters 43 (3), 279-282, 2015
42015
A new lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O (n log n). Arxiv, Report 1006.4661, 2010
R Hildebrand, M Köppe
4
The system can't perform the operation now. Try again later.
Articles 1–20