( en | de | ru )

 

Disambiguation of "Leitner, Markus"

Author of the publication

copydeleteadd this publication to your clipboard
Design of survivable networks with vulnerability constraints.

, and . Eur. J. Oper. Res., 258 (1): 89-103 (2017)

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 Walter Leitner

Gisela Leitner

August Leitner

Waldemar Leitner

Kerstin Leitner

 

Other publications of authors with the same name

Branch-and-Cut-and-Price for Capacitated Connected Facility Location., and . J. Math. Model. Algorithms, 10 (3): 245-267 (2011)Decomposition methods for the two-stage stochastic Steiner tree problem., , , and . Comput. Optim. Appl., 69 (3): 713-752 (2018)The connected facility location polytope., , , and . Discret. Appl. Math., (2018)Large-scale influence maximization via maximal covering location., , , and . Eur. J. Oper. Res., 289 (1): 144-164 (2021)Design of survivable networks with vulnerability constraints., and . Eur. J. Oper. Res., 258 (1): 89-103 (2017)Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization., , and . Math. Oper. Res., 46 (1): 301-316 (2021)Variable Neighborhood Search for Solving the Balanced Location Problem., , and . Electron. Notes Discret. Math., (2012)A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems., , , and . INFORMS J. Comput., 30 (2): 402-420 (2018)A Benders decomposition based framework for solving cable trench problems., , and . Comput. Oper. Res., (2017)On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes., , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 201-212. Springer, (2012)