default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregor Hendel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Gregor Hendel
, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022)- [j4]Gregor Hendel:
Adaptive large neighborhood search for mixed integer programming. Math. Program. Comput. 14(2): 185-221 (2022) - [c7]Timo Berthold, Gregor Hendel, Domenico Salvagnin:
Transferring Information Across Restarts in MIP. CPAIOR 2022: 24-33 - 2021
- [j3]Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - [c6]Timo Berthold, Gregor Hendel:
Learning To Scale Mixed-Integer Programs. AAAI 2021: 3661-3668
2010 – 2019
- 2019
- [c5]Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel:
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. AAAI 2019: 1427-1434 - 2018
- [j2]Timo Berthold, Gregor Hendel, Thorsten Koch:
From feasibility to improvement to proof: three phases of solving mixed-integer programs. Optim. Methods Softw. 33(3): 499-517 (2018) - [c4]Gregor Hendel, Matthias Miltenberger, Jakob Witzig:
Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms. OR 2018: 513-519 - 2015
- [j1]Timo Berthold, Gregor Hendel:
Shift-and-Propagate. J. Heuristics 21(1): 73-106 (2015) - [c3]Gregor Hendel:
Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs. CPAIOR 2015: 199-214 - [c2]Gregor Hendel:
Exploiting Solving Phases for Mixed-Integer Programs. OR 2015: 3-9 - 2011
- [c1]Tobias Achterberg, Timo Berthold, Gregor Hendel:
Rounding and Propagation Heuristics for Mixed Integer Programming. OR 2011: 71-76
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-04-24 22:50 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:
