( en | de | ru )

 

Disambiguation of "Sinnl, Markus"

Author of the publication

copydeleteadd this publication to your clipboard
Large-scale influence maximization via maximal covering location.

, , , and . Eur. J. Oper. Res., 289 (1): 144-164 (2021)

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.

Markus Markus

Markus Kurscheidt

Ökonomische Analyse von Sportgroßveranstaltungen: ein integrierter Evaluierungs- und Management-Ansatz am Beispiel von Fußball-Weltmeisterschaften. Uni Paderborn, (2007)

Markus Perling

Cohomology vanishing and exceptional sequences. Uni Bochum, habilitation, (2009)

Markus Knauer

Struktur-Reaktivitäts-Korrelation von Dieselruß und Charakterisierung von PAHs und Carbonylen im Abgas von Biokraftstoffen. TU München, (2010)

Markus Niemann

From Anomalous Deterministic Diffusion to the Continuous-Time Random Walk. Uni Wuppertal, (2009)
 

Other publications of authors with the same name

An iterative exact algorithm for the weighted fair sequences problem.. Comput. Oper. Res., (2022)SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs., , , , and . CoRR, (2021)Benders decomposition algorithms for minimizing the spread of harmful contagions in networks., , , and . CoRR, (2023)A scaleable projection-based branch-and-cut algorithm for the p-center problem., and . Eur. J. Oper. Res., 303 (1): 78-98 (2022)Intersection Cuts for Bilevel Optimization., , , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 77-88. Springer, (2016)A note on computational aspects of the Steiner traveling salesman problem., and . ITOR, 26 (4): 1396-1401 (2019)A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems., and . Comput. Oper. Res., (2017)SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs., , , , and . IPCO, volume 13265 of Lecture Notes in Computer Science, page 262-276. Springer, (2022)On Solving the Minimum Common String Partition Problem by Decision Diagrams., and . ICORES, page 177-184. SCITEPRESS, (2022)Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem., and . Optim. Lett., 13 (7): 1693-1709 (2019)