Author Info
Name
Affiliation
Papers
ROBERT HILDEBRAND
Univ Calif Davis, Dept Math, Davis, CA 95616 USA
18
Collaborators
Citations 
PageRank 
13
69
7.82
Referers 
Referees 
References 
63
157
219
Search Limit
100157
Title
Citations
PageRank
Year
Complexity, Exactness, and Rationality in Polynomial Optimization.00.342021
On Perturbation Spaces Of Minimal Valid Functions: Inverse Semigroup Theory And Equivariant Decomposition Theorem00.342019
Minimal Cut-Generating Functions are Nearly Extreme.40.442018
Mixed Integer Reformulations of Integer Programs and the Affine TU-dimension of a Matrix00.342018
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem30.452018
Binary extended formulations of polyhedral mixed-integer sets.00.342018
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations.20.402017
Light on the infinite group relaxation I: foundations and taxonomy.10.352016
Note on the complexity of the mixed-integer hull of a polyhedron.20.422015
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case50.412015
The triangle closure is a polyhedron50.442014
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2.80.512014
Light On The Infinite Group Relaxation I: Foundations And Taxonomy150.792014
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.140.752013
Equivariant perturbation in gomory and Johnson's infinite group problem: II. the unimodular two-dimensional case40.392013
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).00.342013
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets40.402011
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization20.372010