( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Facilitate SIMD-Code-Generation in the Polyhedral Model by Hardware-aware Automatic Code-Transformation

, , , и . IMPACT 2013, (2013)

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.

Sebastian Mallach

Norbert Mallach

Notker Mallach

Josef Mallach

Oskar Svenson

 

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

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays.. J. Comb. Optim., 36 (3): 871-895 (2018)Compact Layered Drawings of General Directed Graphs., , , , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 209-221. Springer, (2016)Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.. IWOCA, том 10765 из Lecture Notes in Computer Science, стр. 327-340. Springer, (2017)Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints.. CoRR, (2016)More General Optimal Offset Assignment.. Leibniz Trans. Embed. Syst., 2 (1): 02:1-02:18 (2015)Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization., и . ESA, том 144 из LIPIcs, стр. 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Compact linearization for binary quadratic problems subject to assignment constraints.. 4OR, 16 (3): 295-309 (2018)Linear ordering based MIP formulations for the vertex separation or pathwidth problem.. J. Discrete Algorithms, (2018)Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching., , и . ACDA, стр. 63-74. SIAM, (2023)Inductive linearization for binary quadratic programs with linear constraints: a computational study.. 4OR, 22 (1): 47-87 (марта 2024)