From post

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.

 

Другие публикации лиц с тем же именем

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem., и . SIAM J. Optimization, 29 (1): 369-398 (2019)Implications, conflicts, and reductions for Steiner trees., и . Math. Program., 197 (2): 903-966 (февраля 2023)Implications, Conflicts, and Reductions for Steiner Trees., и . IPCO, том 12707 из Lecture Notes in Computer Science, стр. 473-487. Springer, (2021)First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method., , , , и . OR, стр. 105-111. Springer, (2019)Optimal connected subgraphs: Integer programming formulations and polyhedra., , и . Networks, 80 (3): 314-332 (2022)Enabling Research through the SCIP Optimization Suite 8.0., , , , , , , , , и 25 other автор(ы). ACM Trans. Math. Softw., 49 (2): 22:1-22:21 (июня 2023)Faster exact solution of sparse MaxCut and QUBO problems., , и . CoRR, (2022)APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers., , и . IPDPS Workshops, стр. 413. IEEE, (2022)Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores., , и . CPAIOR, том 11494 из Lecture Notes in Computer Science, стр. 529-539. Springer, (2019)Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem., , и . Networks, 73 (2): 206-233 (2019)