default search action
Daniel Rehfeldt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Jaap Pedersen
, Jann Michael Weinand
An efficient solver for large-scale onshore wind farm siting including cable routing. Eur. J. Oper. Res. 317(2): 616-630 (2024) - 2023
- [j10]Daniel Rehfeldt
Implications, conflicts, and reductions for Steiner trees. Math. Program. 197(2): 903-966 (2023) - [j9]Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. Math. Program. Comput. 15(3): 445-470 (2023) - [j8]Ksenia Bestuzheva
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - 2022
- [j7]Daniel Rehfeldt
A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models. Eur. J. Oper. Res. 296(1): 60-71 (2022) - [j6]Daniel Rehfeldt
On the Exact Solution of Prize-Collecting Steiner Tree Problems. INFORMS J. Comput. 34(2): 872-889 (2022) - [j5]Daniel Rehfeldt
Optimal connected subgraphs: Integer programming formulations and polyhedra. Networks 80(3): 314-332 (2022) - [c9]Thorsten Koch, Daniel Rehfeldt, Yuji Shinano:
APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers. IPDPS Workshops 2022: 413 - [c8]Daniel Rehfeldt:
Faster Algorithms for Steiner Tree and Related Problems: From Theory to Practice. OR 2022: 19-25 - [i1]Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. CoRR abs/2202.02305 (2022) - 2021
- [c7]Daniel Rehfeldt
Implications, Conflicts, and Reductions for Steiner Trees. IPCO 2021: 473-487 - 2020
- [j4]Yahui Sun
A Physarum-Inspired Algorithm for Minimum-Cost Relay Node Placement in Wireless Sensor Networks. IEEE/ACM Trans. Netw. 28(2): 681-694 (2020)
2010 – 2019
- 2019
- [j3]Daniel Rehfeldt
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. Networks 73(2): 206-233 (2019) - [j2]Daniel Rehfeldt
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem. SIAM J. Optim. 29(1): 369-398 (2019) - [c6]Yuji Shinano
Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores. CPAIOR 2019: 529-539 - [c5]Yuji Shinano, Daniel Rehfeldt, Tristan Gally:
An Easy Way to Build Parallel State-of-the-art Combinatorial Optimization Problem Solvers: A Computational Study on Solving Steiner Tree Problems and Mixed Integer Semidefinite Programs by using ug[SCIP-*, *]-Libraries. IPDPS Workshops 2019: 530-541 - [c4]Ambros M. Gleixner
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method. OR 2019: 105-111 - 2017
- [j1]Gerald Gamrath
SCIP-Jack - a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2): 231-296 (2017) - [c3]Daniel Rehfeldt, Thorsten Koch:
SCIP-Jack - A Solver for STP and Variants with Parallelization Extensions: An Update. OR 2017: 191-196 - [c2]Thomas Breuer
Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods. OR 2017: 641-647 - 2016
- [c1]Stephen J. Maher, Matthias Miltenberger
PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite. ICMS 2016: 301-307
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-07 21:25 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: