Markus Sinnl

According to our database1, Markus Sinnl authored at least 38 papers between 2013 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Large-scale influence maximization via maximal covering location.
Eur. J. Oper. Res., 2021

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res., 2021

2020
A branch-and-cut algorithm for the maximum covering cycle problem.
Ann. Oper. Res., 2020

Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem.
Optim. Lett., 2019

A note on computational aspects of the Steiner traveling salesman problem.
Int. Trans. Oper. Res., 2019

Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput., 2019

A note on computational approaches for the antibandwidth problem.
CoRR, 2019

Algorithmic expedients for the S-labeling problem.
CoRR, 2019

Algorithmic expedients for the <i>S</i>-labeling problem.
Comput. Oper. Res., 2019

An exact solution framework for the multiple gradual cover location problem.
Comput. Oper. Res., 2019

2018
An exact solution framework for the minimum cost dominating tree problem.
Optim. Lett., 2018

On the use of intersection cuts for bilevel optimization.
Math. Program., 2018

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput., 2018

Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria.
Int. J. Medical Informatics, 2018

A dynamic reformulation heuristic for Generalized Interdiction Problems.
Eur. J. Oper. Res., 2018

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems.
Eur. J. Oper. Res., 2018

The connected facility location polytope.
Discret. Appl. Math., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.
Comput. Optim. Appl., 2018

2017
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

Redesigning Benders Decomposition for Large-Scale Facility Location.
Manag. Sci., 2017

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res., 2017

An algorithmic framework for the exact solution of tree-star problems.
Eur. J. Oper. Res., 2017

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res., 2017

Solving minimum-cost shared arborescence problems.
Eur. J. Oper. Res., 2017

A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems.
Comput. Oper. Res., 2017

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems.
Comput. Oper. Res., 2017

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death.
Ann. Oper. Res., 2017

2016
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.
Math. Program. Comput., 2016

Benders decomposition without separability: A computational study for capacitated facility location problems.
Eur. J. Oper. Res., 2016

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res., 2016

Intersection Cuts for Bilevel Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Optimal Upgrading Schemes for Effective Shortest Paths in Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput., 2015

ILP and CP Formulations for the Lazy Bureaucrat Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
On the Asymmetric Connected Facility Location Polytope.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
On the Two-Architecture Connected Facility Location Problem.
Electron. Notes Discret. Math., 2013

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013


  Loading...