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
40 2013 A A Basu, R Hildebrand, M Koppe, M Molinaro
SIAM Journal on Optimization 23 (2), 1021-1040, 2013
40 2013 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
26 * 2015 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, 565-584, 2018
25 2018 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), 301-358, 2017
25 2017 Light on the infinite group relaxation I: foundations and taxonomy A Basu, R Hildebrand, M Köppe
4OR 14, 1-40, 2016
23 2016 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
16 2016 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
15 2016 Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms A Basu, R Hildebrand, M Köppe
4OR 14, 107-131, 2016
13 2016 The triangle closure is a polyhedron A Basu, R Hildebrand, M Köppe
Mathematical Programming 145 (1), 19-58, 2014
13 2014 Compact mixed-integer programming formulations in quadratic optimization B Beach, R Hildebrand, J Huchette
Journal of Global Optimization 84 (4), 869-912, 2022
12 * 2022 An autonomous task assignment paradigm for autonomous robotic in-space assembly J Moser, J Hoffman, R Hildebrand, E Komendera
Frontiers in Robotics and AI 9, 709905, 2022
11 2022 Binary extended formulations of polyhedral mixed-integer sets S Dash, O Gunluk, R Hildebrand
Mathematical Programming 170, 207-236, 2018
11 2018 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
11 2017 Minimal cut-generating functions are nearly extreme A Basu, R Hildebrand, M Molinaro
Mathematical Programming 172, 329-349, 2018
10 2018 Complexity, exactness, and rationality in polynomial optimization D Bienstock, AD Pia, R Hildebrand
Mathematical Programming, 1-32, 2022
9 2022 An approximate method for the optimization of long-horizon tank blending and scheduling operations B Beach, R Hildebrand, K Ellis, B Lebreton
Computers & Chemical Engineering 141, 106839, 2020
9 2020 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
8 2015 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
8 2013 Recent developments in robust, accurate autonomous assembly methods for surface and orbital structures J Moser, MR Anderson, H Everson, A Quartaro, WD Chapin, B Beach, ...
ASCEND 2020, 4270, 2020
7 2020 
Matthias KoeppeProfessor of Mathematics, UC DavisGeverifieerd e-mailadres voor math.ucdavis.edu