default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Hildebrand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. Comput. Optim. Appl. 87(3): 835-891 (2024)- [j20]Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand:
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. Comput. Optim. Appl. 87(3): 893-934 (2024) - [j19]Jamie Fravel, Robert Hildebrand, Laurel Travis:
Continuous Equality Knapsack with Probit-Style Objectives. J. Optim. Theory Appl. 202(3): 1060-1076 (2024) - [i8]Hyunwoo Lee, Robert Hildebrand, Wenbo Cai, I. Esra Büyüktahtakin:
Algorithms for Finding the Best Pure Nash Equilibrium in Edge-weighted Budgeted Maximum Coverage Games. CoRR abs/2409.04078 (2024) - 2023
- [j18]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, exactness, and rationality in polynomial optimization. Math. Program. 197(2): 661-692 (2023) - 2022
- [j17]Joshua Moser, Julia Hoffman, Robert Hildebrand, Erik Komendera:
An Autonomous Task Assignment Paradigm for Autonomous Robotic In-Space Assembly. Frontiers Robotics AI 9: 709905 (2022) - [j16]Benjamin Beach, Robert Hildebrand, Joey Huchette:
Compact mixed-integer programming formulations in quadratic optimization. J. Glob. Optim. 84(4): 869-912 (2022) - [j15]Robert Hildebrand, Matthias Köppe, Yuan Zhou:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations. Open J. Math. Optim. 3: 1-44 (2022) - 2021
- [c6]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, Exactness, and Rationality in Polynomial Optimization. IPCO 2021: 58-72 - 2020
- [j14]Benjamin Beach, Robert Hildebrand, Kimberly P. Ellis, Baptiste Lebreton:
An approximate method for the optimization of long-Horizon tank blending and scheduling operations. Comput. Chem. Eng. 141: 106839 (2020) - [i7]Joshua Moser, Julia Hoffman, Robert Hildebrand, Erik Komendera:
A Flexible Job Shop Scheduling Representation of the Autonomous In-Space Assembly Task Assignment Problem. CoRR abs/2003.12148 (2020)
2010 – 2019
- 2019
- [c5]Robert Hildebrand, Matthias Köppe, Yuan Zhou:
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. IPCO 2019: 247-260 - 2018
- [j13]Jörg Bader, Robert Hildebrand, Robert Weismantel, Rico Zenklusen:
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. 169(2): 565-584 (2018) - [j12]Sanjeeb Dash, Oktay Günlük, Robert Hildebrand:
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1): 207-236 (2018) - [j11]Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal cut-generating functions are nearly extreme. Math. Program. 172(1-2): 329-349 (2018) - [j10]Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen:
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. 32(1): 352-371 (2018) - 2017
- [j9]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. 163(1-2): 301-358 (2017) - [c4]Robert Hildebrand, Robert Weismantel, Rico Zenklusen:
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA 2017: 2342-2350 - 2016
- [j8]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14(1): 1-40 (2016) - [j7]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2): 107-131 (2016) - [j6]Alberto Del Pia, Robert Hildebrand, Robert Weismantel, Kevin Zemmer:
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. Math. Oper. Res. 41(2): 511-530 (2016) - [c3]Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal Cut-Generating Functions are Nearly Extreme. IPCO 2016: 202-213 - [c2]Robert Hildebrand, Robert Weismantel, Kevin Zemmer:
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. SODA 2016: 1715-1723 - 2015
- [j5]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. Math. Oper. Res. 40(1): 105-129 (2015) - [j4]Robert Hildebrand, Timm Oertel, Robert Weismantel:
Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43(3): 279-282 (2015) - 2014
- [j3]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The triangle closure is a polyhedron. Math. Program. 145(1-2): 19-58 (2014) - [i6]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2. CoRR abs/1403.4628 (2014) - [i5]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the Infinite Group Relaxation. CoRR abs/1410.8584 (2014) - 2013
- [j2]Robert Hildebrand, Matthias Köppe:
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn). Discret. Optim. 10(1): 69-84 (2013) - [j1]Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro:
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23(2): 1021-1040 (2013) - [c1]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. IPCO 2013: 62-73 - 2012
- [i4]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case. CoRR abs/1210.6732 (2012) - 2011
- [i3]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets. CoRR abs/1107.5068 (2011) - [i2]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The Triangle Closure is a Polyhedron. CoRR abs/1111.1780 (2011) - 2010
- [i1]Robert Hildebrand, Matthias Köppe:
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization. CoRR abs/1006.4661 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
