A Faster Algorithm for Quasi-convex Integer Polynomial Optimization - Robert Hildebrand; Matthias Köppe (CoRR, 2010)

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets - Amitabh Basu; Robert Hildebrand; Matthias Köppe (CoRR, 2011)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (IPCO, 2013)

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn). - Robert Hildebrand; Matthias Köppe (Discret. Optim., 2013)

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. - Amitabh Basu; Robert Hildebrand; Matthias Köppe; Marco Molinaro 001 (SIAM J. Optim., 2013)

Light on the Infinite Group Relaxation. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (CoRR, 2014)

The triangle closure is a polyhedron. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Program., 2014)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Oper. Res., 2015)

Note on the complexity of the mixed-integer hull of a polyhedron. - Robert Hildebrand; Timm Oertel; Robert Weismantel (Oper. Res. Lett., 2015)

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. - Robert Hildebrand; Robert Weismantel; Kevin Zemmer (SODA, 2016)

Light on the infinite group relaxation I: foundations and taxonomy. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (4OR, 2016)

Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (4OR, 2016)

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. - Alberto Del Pia; Robert Hildebrand; Robert Weismantel; Kevin Zemmer (Math. Oper. Res., 2016)

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. - Robert Hildebrand; Robert Weismantel; Rico Zenklusen (SODA, 2017)

Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Program., 2017)

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. - Jörg Bader; Robert Hildebrand; Robert Weismantel; Rico Zenklusen (Math. Program., 2018)

Minimal cut-generating functions are nearly extreme. - Amitabh Basu; Robert Hildebrand; Marco Molinaro 001 (Math. Program., 2018)

Binary extended formulations of polyhedral mixed-integer sets. - Sanjeeb Dash; Oktay Günlük; Robert Hildebrand (Math. Program., 2018)

Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. - Stephen R. Chestnut; Robert Hildebrand; Rico Zenklusen (SIAM J. Discret. Math., 2018)

On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. - Robert Hildebrand; Matthias Köppe; Yuan Zhou 002 (IPCO, 2019)

An approximate method for the optimization of long-Horizon tank blending and scheduling operations. - Benjamin Beach; Robert Hildebrand; Kimberly P. Ellis; Baptiste Lebreton (Comput. Chem. Eng., 2020)

A Flexible Job Shop Scheduling Representation of the Autonomous In-Space Assembly Task Assignment Problem. - Joshua Moser; Julia Hoffman; Robert Hildebrand; Erik Komendera (CoRR, 2020)

An Autonomous Task Assignment Paradigm for Autonomous Robotic In-Space Assembly. - Joshua Moser; Julia Hoffman; Robert Hildebrand; Erik Komendera (Frontiers Robotics AI, 2022)

Compact mixed-integer programming formulations in quadratic optimization. - Benjamin Beach; Robert Hildebrand; Joey Huchette (J. Glob. Optim., 2022)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations. - Robert Hildebrand; Matthias Köppe; Yuan Zhou 002 (Open J. Math. Optim., 2022)

Complexity, exactness, and rationality in polynomial optimization. - Daniel Bienstock; Alberto Del Pia; Robert Hildebrand (Math. Program., 2023)

Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study. - Brannon King; Robert Hildebrand (FedCSIS (Communication Papers), 2024)

Algorithms for Finding the Best Pure Nash Equilibrium in Edge-weighted Budgeted Maximum Coverage Games. - Hyunwoo Lee 005; Robert Hildebrand; Wenbo Cai; I. Esra Büyüktahtakin (CoRR, 2024)

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. - Benjamin Beach; Robert Burlacu; Andreas Bärmann; Lukas Hager; Robert Hildebrand (Comput. Optim. Appl., 2024)

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. - Benjamin Beach; Robert Burlacu; Andreas Bärmann; Lukas Hager; Robert Hildebrand (Comput. Optim. Appl., 2024)

Continuous Equality Knapsack with Probit-Style Objectives. - Jamie Fravel; Robert Hildebrand; Laurel Travis (J. Optim. Theory Appl., 2024)