Robert Hildebrand

36 papers A* 2B 4Journal 29Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Algorithms for Finding the Best Pure Nash Equilibrium in Edge-weighted Budgeted Maximum Coverage Games. CoRR Hyunwoo Lee, Robert Hildebrand, Wenbo Cai, I. Esra Büyüktahtakin
2024	J	`jnl`	Continuous Equality Knapsack with Probit-Style Objectives. J. Optim. Theory Appl. Jamie Fravel, Robert Hildebrand, Laurel Travis
2024	J	`jnl`	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. Comput. Optim. Appl. Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand
2024	J	`jnl`	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. Comput. Optim. Appl. Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand
2024	—	`conf`	Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study. FedCSIS (Communication Papers) Brannon King, Robert Hildebrand
2023	J	`jnl`	Complexity, exactness, and rationality in polynomial optimization. Math. Program. Daniel Bienstock, Alberto Del Pia, Robert Hildebrand
2022	J	`jnl`	An Autonomous Task Assignment Paradigm for Autonomous Robotic In-Space Assembly. Frontiers Robotics AI Joshua Moser, Julia Hoffman, Robert Hildebrand, Erik Komendera
2022	J	`jnl`	Compact mixed-integer programming formulations in quadratic optimization. J. Glob. Optim. Benjamin Beach, Robert Hildebrand, Joey Huchette
2022	J	`jnl`	Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations. Open J. Math. Optim. Robert Hildebrand, Matthias Köppe, Yuan Zhou
2021	B	`conf`	Complexity, Exactness, and Rationality in Polynomial Optimization. IPCO Daniel Bienstock, Alberto Del Pia, Robert Hildebrand
2020	J	`jnl`	A Flexible Job Shop Scheduling Representation of the Autonomous In-Space Assembly Task Assignment Problem. CoRR Joshua Moser, Julia Hoffman, Robert Hildebrand, Erik Komendera
2020	J	`jnl`	An approximate method for the optimization of long-Horizon tank blending and scheduling operations. Comput. Chem. Eng. Benjamin Beach, Robert Hildebrand, Kimberly P. Ellis, Baptiste Lebreton
2019	B	`conf`	On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. IPCO Robert Hildebrand, Matthias Köppe, Yuan Zhou
2018	J	`jnl`	Binary extended formulations of polyhedral mixed-integer sets. Math. Program. Sanjeeb Dash, Oktay Günlük, Robert Hildebrand
2018	J	`jnl`	Minimal cut-generating functions are nearly extreme. Math. Program. Amitabh Basu, Robert Hildebrand, Marco Molinaro
2018	J	`jnl`	Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. Jörg Bader, Robert Hildebrand, Robert Weismantel, Rico Zenklusen
2018	J	`jnl`	Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen
2017	J	`jnl`	Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. Amitabh Basu, Robert Hildebrand, Matthias Köppe
2017	A*	`conf`	Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA Robert Hildebrand, Robert Weismantel, Rico Zenklusen
2016	A*	`conf`	An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. SODA Robert Hildebrand, Robert Weismantel, Kevin Zemmer
2016	J	`jnl`	Light on the infinite group relaxation I: foundations and taxonomy. 4OR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2016	J	`jnl`	Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2016	B	`conf`	Minimal Cut-Generating Functions are Nearly Extreme. IPCO Amitabh Basu, Robert Hildebrand, Marco Molinaro
2016	J	`jnl`	Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. Math. Oper. Res. Alberto Del Pia, Robert Hildebrand, Robert Weismantel, Kevin Zemmer
2015	J	`jnl`	Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. Math. Oper. Res. Amitabh Basu, Robert Hildebrand, Matthias Köppe
2015	J	`jnl`	Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. Robert Hildebrand, Timm Oertel, Robert Weismantel
2014	J	`jnl`	Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2. CoRR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2014	J	`jnl`	Light on the Infinite Group Relaxation. CoRR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2014	J	`jnl`	The triangle closure is a polyhedron. Math. Program. Amitabh Basu, Robert Hildebrand, Matthias Köppe
2013	J	`jnl`	A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro
2013	J	`jnl`	A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2 Discret. Optim. Robert Hildebrand, Matthias Köppe
2013	B	`conf`	Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. IPCO Amitabh Basu, Robert Hildebrand, Matthias Köppe
2012	J	`jnl`	Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case CoRR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2011	J	`jnl`	Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets CoRR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2011	J	`jnl`	The Triangle Closure is a Polyhedron CoRR Amitabh Basu, Robert Hildebrand, Matthias Köppe
2010	J	`jnl`	A Faster Algorithm for Quasi-convex Integer Polynomial Optimization CoRR Robert Hildebrand, Matthias Köppe