default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Heinz 0001
Person information
- affiliation: Fair Isaac Germany GmbH, Berlin, Germany
- affiliation (former): Zuse Institute, Berlin, Germany
Other persons with the same name
- Stefan Heinz 0002
![[0000-0002-4871-2416]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4871-2416")
— University of Wyoming, Mechanical Engineering Department, Laramie, WY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Jakob Witzig, Timo Berthold, Stefan Heinz:
Computational aspects of infeasibility analysis in mixed integer programming. Math. Program. Comput. 13(4): 753-785 (2021)
2010 – 2019
- 2019
- [j9]Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler:
Structure-driven fix-and-propagate heuristics for mixed integer programming. Math. Program. Comput. 11(4): 675-702 (2019) - [c17]Jakob Witzig, Timo Berthold, Stefan Heinz:
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. CPAIOR 2019: 84-94 - 2018
- [b1]Stefan Heinz:
Presolving techniques and linear relaxations for cumulative scheduling. Technical University of Berlin, Germany, 2018 - [j8]Yuji Shinano, Stefan Heinz, Stefan Vigerske, Michael Winkler:
FiberSCIP - A Shared Memory Parallelization of SCIP. INFORMS J. Comput. 30(1): 11-30 (2018) - [j7]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. Optim. Methods Softw. 33(3): 518-529 (2018) - [j6]Yuji Shinano, Timo Berthold, Stefan Heinz:
ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers. Optim. Methods Softw. 33(3): 530-539 (2018) - 2017
- [c16]Jakob Witzig, Timo Berthold, Stefan Heinz:
Experiments with Conflict Analysis in Mixed Integer Programming. CPAIOR 2017: 211-220 - 2016
- [c15]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. ICMS 2016: 251-258 - [c14]Yuji Shinano, Timo Berthold, Stefan Heinz:
A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers. ICMS 2016: 308-316 - [c13]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler:
Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. IPDPS 2016: 770-779 - 2014
- [j5]Stefan Heinz, Jörg Rambau, Andreas Tuchscherer:
Computational bounds for elevator control policies by large scale linear programming. Math. Methods Oper. Res. 79(1): 87-117 (2014) - [c12]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler:
Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. IPDPS Workshops 2014: 1552-1561 - 2013
- [j4]Stefan Heinz, Jens Schulz, J. Christopher Beck:
Using dual presolving reductions to reformulate cumulative constraints. Constraints An Int. J. 18(2): 166-201 (2013) - [c11]Stefan Heinz, Wen-Yang Ku, J. Christopher Beck:
Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling. CPAIOR 2013: 12-27 - 2012
- [j3]Stefan Heinz, Thomas Schlechte, Rüdiger Stephan, Michael Winkler:
Solving steel mill slab design problems. Constraints An Int. J. 17(1): 39-50 (2012) - [c10]Stefan Heinz, J. Christopher Beck:
Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling. CPAIOR 2012: 211-227 - 2011
- [j2]Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [c9]Timo Berthold, Stefan Heinz, Jens Schulz:
An Approximative Criterion for the Potential of Energetic Reasoning. TAPAS 2011: 229-239 - [c8]Stefan Heinz, Jens Schulz:
Explanations for the Cumulative Constraint: An Experimental Study. SEA 2011: 400-409 - 2010
- [c7]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch:
ParaSCIP: A Parallel Extension of SCIP. CHPC 2010: 135-148 - [c6]Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz:
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317
2000 – 2009
- 2009
- [j1]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. Theory Comput. Syst. 45(3): 533-554 (2009) - [c5]Stefan Heinz, Martin Sachenbacher:
Using Model Counting to Find Optimal Distinguishing Tests. CPAIOR 2009: 117-131 - [c4]Timo Berthold, Stefan Heinz, Marc E. Pfetsch:
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. SAT 2009: 441-446 - 2008
- [c3]Tobias Achterberg, Stefan Heinz, Thorsten Koch:
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. CPAIOR 2008: 278-282 - 2006
- [c2]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. WAOA 2006: 240-252 - 2005
- [c1]Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld:
The Online Target Date Assignment Problem. WAOA 2005: 230-243
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-11-11 22:24 CET 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:
