If you made any changes in Pure these will be visible here soon.

Personal profile

Personal information

Markus Leitner is an Associate Professor at the Department of Supply Chain Analytics at the School of Business and Economics, VU Amsterdam.

Markus Leitner received his PhD (Dr. techn.) in Computer Science from the Vienna University of Technology in 2010 and his habilitation (venia docendi) in Operations Research from the University of Vienna in 2016. Before joining VU Amsterdam, he was employed as a fixed term Assistant Professor (University Assistant) at the University of Vienna. Prior to that he was a postdoctoral researcher and lecturer at Vienna University of Technology, University of Vienna and Université libre de Bruxelles. He was also a visiting researcher at the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) in Montreal, Canada.

Ancillary activities

  • Unviersity of Vienna | Leiden (Vienna) | Medewerker | 2019-01-01 - present

Ancillary activities are updated daily

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Steiner Tree Problem Mathematics
Branch-and-cut Mathematics
Integer programming Engineering & Materials Science
Linear programming Engineering & Materials Science
Network Design Mathematics
Facility Location Mathematics
Steiner Tree Mathematics
Vertex of a graph Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2019

  • 27 Article
  • 6 Conference contribution

Exact Approaches for Network Design Problems with Relays

Leitner, M., Ljubic, I., Riedler, M. & Ruthmair, M., 2019, In : INFORMS Journal on Computing. 31, 1, p. 171-192

Research output: Contribution to JournalArticleAcademicpeer-review

Linear programming
Telecommunication networks
Network design
Branch-and-price
Destination

Exact approaches for the directed network design problem with relays

Leitner, M., Ljubic, I., Ruthmair, M. & Riedler, M., 2019, (Accepted/In press) In : Omega. 17 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Network design
Communication
Polynomials
Destination
Valid inequalities

Layered graph approaches for combinatorial optimization problems

Gouveia, L., Leitner, M. & Ruthmair, M., 2019, In : Computers and Operations Research. 102, p. 22-38

Research output: Contribution to JournalArticleAcademicpeer-review

Combinatorial optimization
Integer programming
Combinatorial Optimization Problem
Decomposition
Graph in graph theory

A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems

Leitner, M., Ljubic, I., Luipersbeck, M. & Sinnl, M., 2018, In : INFORMS Journal on Computing. 30, 2, p. 217-420

Research output: Contribution to JournalArticleAcademicpeer-review

Bioinformatics
Branch-and-bound
Network design
Node

Branch-and-cut methods for the network design problem with vulnerability constraints

Gouveia, L., Leitner, M. & Joyce-Moniz, M., 2018, In : Computers and Operations Research. 91, p. 190-208

Research output: Contribution to JournalArticleAcademicpeer-review

Branch-and-cut
Network Design
Vulnerability
Inductive logic programming (ILP)
Formulation