Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Markus Sinnl
Observed name:
Sinnl, Markus
Institution:
Johannes Kepler University of Linz
Observed institutions:
Johannes Kepler University of Linz,
University of Vienna,
Institut national de recherche en sciences et technologies du numérique,
Centre Inria de l'Université de Lille,
INOCS: Optimisation intégrée pour problèmes à structure complexe
ORCID:
0000-0003-1439-8702
Observed ORCID:
0000-0003-1439-8702
OpenAlex ID:
A5030387525
Works
77
Awards
1
Redesigning Benders Decomposition for Large-Scale Facility Location
2016
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
Management Science
·
272
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
2017
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
Operations Research
·
224
PDF
Benders decomposition without separability: A computational study for capacitated facility location problems
2016
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
European Journal of Operational Research
·
187
On the use of intersection cuts for bilevel optimization
2017
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
Mathematical Programming
·
114
PDF
Thinning out Steiner trees: a node-based model for uniform edge costs
2016
·
Matteo Fischetti
, Markus Leitner
, et al.
·
Mathematical Programming Computation
·
111
PDF
Interdiction Games and Monotonicity, with Application to Knapsack Problems
2019
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
INFORMS journal on computing
·
107
Large-scale influence maximization via maximal covering location
2020
·
Evren Güney
, Markus Leitner
, et al.
·
European Journal of Operational Research
·
50
PDF
Benders decomposition for competitive influence maximization in (social) networks
2020
·
Michael Kahr
, Markus Leitner
, et al.
·
Omega
·
47
PDF
Intersection Cuts for Bilevel Optimization
2016
·
Matteo Fischetti
, Ivana Ljubić
, et al.
·
Lecture notes in computer science
·
46
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
2018
·
Markus Leitner
, Ivana Ljubić
, et al.
·
INFORMS journal on computing
·
41
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
2017
·
Fabio Furini
, Ivana Ljubić
, et al.
·
European Journal of Operational Research
·
40
A dynamic reformulation heuristic for Generalized Interdiction Problems
2017
·
Matteo Fischetti
, Michele Monaci
, et al.
·
European Journal of Operational Research
·
38
PDF
A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem
2022
·
Elisabeth Gaar
, Markus Sinnl
·
European Journal of Operational Research
·
25
PDF
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
2014
·
Markus Leitner
, Ivana Ljubić
, et al.
·
INFORMS journal on computing
·
25
Alteration of Golgi Structure by Stress: A Link to Neurodegeneration?
2015
·
Eduardo A. Alvarez-Miranda
, Markus Sinnl
, et al.
·
Frontiers in Neuroscience
·
24
PDF
An exact method for binary fortification games
2022
·
Markus Leitner
, Ivana Ljubić
, et al.
·
European Journal of Operational Research
·
23
PDF
Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria
2017
·
Robert Fritze
, Anita Graser
, et al.
·
International Journal of Medical Informatics
·
21
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
2016
·
Markus Leitner
, Ivana Ljubić
, et al.
·
Computers & Operations Research
·
21
An algorithmic framework for the exact solution of tree-star problems
2017
·
Markus Leitner
, Ivana Ljubić
, et al.
·
European Journal of Operational Research
·
18
PDF
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
2019
·
Eduardo Álvarez-Miranda
, Marcos Goycoolea
, et al.
·
European Journal of Operational Research
·
17
PDF
Decomposition methods for the two-stage stochastic Steiner tree problem
2017
·
Markus Leitner
, Ivana Ljubić
, et al.
·
Computational Optimization and Applications
·
15
PDF
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
2016
·
Markus Sinnl
, Ivana Ljubić
·
Mathematical Programming Computation
·
15
PDF
An exact solution framework for the multiple gradual cover location problem
2019
·
Eduardo Álvarez-Miranda
, Markus Sinnl
·
Computers & Operations Research
·
14
PDF
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
2017
·
Eduardo Álvarez-Miranda
, Markus Sinnl
·
Computers & Operations Research
·
14
An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems
2024
·
Fritz Bökler
, Sophie N. Parragh
, et al.
·
Mathematical Methods of Operations Research
·
12
PDF
Show more works
View as search
Works count:
77
Citation count:
1,729
H-index:
18
I10-index:
34
Year
Topic
Type