( en | de | ru )

 

Disambiguation of "Rehfeldt, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite.

, , , , , and . ICMS, volume 9725 of Lecture Notes in Computer Science, page 301-307. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Roswitha Rehfeldt

Dietrich Rehfeldt

Klaus Rehfeldt

Gerhard Rehfeldt

Arthur Rehfeldt

 

Other publications of authors with the same name

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem., and . SIAM J. Optimization, 29 (1): 369-398 (2019)Implications, conflicts, and reductions for Steiner trees., and . Math. Program., 197 (2): 903-966 (February 2023)Implications, Conflicts, and Reductions for Steiner Trees., and . IPCO, volume 12707 of Lecture Notes in Computer Science, page 473-487. Springer, (2021)First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method., , , , and . OR, page 105-111. Springer, (2019)Optimal connected subgraphs: Integer programming formulations and polyhedra., , and . Networks, 80 (3): 314-332 (2022)Enabling Research through the SCIP Optimization Suite 8.0., , , , , , , , , and 25 other author(s). ACM Trans. Math. Softw., 49 (2): 22:1-22:21 (June 2023)Faster exact solution of sparse MaxCut and QUBO problems., , and . CoRR, (2022)APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers., , and . IPDPS Workshops, page 413. IEEE, (2022)On the Exact Solution of Prize-Collecting Steiner Tree Problems., and . INFORMS J. Comput., 34 (2): 872-889 (2022)Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem., , and . Networks, 73 (2): 206-233 (2019)