Markus Sinnl
Orcid: 0000-0003-1439-8702Affiliations:
- Johannes Kepler University, Linz, Austria
- University of Vienna, Austria (former)
According to our database1,
Markus Sinnl
authored at least 63 papers
between 2013 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
10
1
7
2
6
8
1
6
8
9
3
1
2
1
2
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on twitter.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2025
A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service.
Comput. Oper. Res., 2025
2024
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems.
Math. Methods Oper. Res., August, 2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program., July, 2024
Comput. Oper. Res., January, 2024
Recent advances in exact optimization methods for OR applications - Special issue editorial.
EURO J. Comput. Optim., 2024
Mixed-integer linear programming approaches for nested <i>p</i>-center problems with absolute and relative regret objectives.
CoRR, 2024
CoRR, 2024
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.
Comput. Oper. Res., 2024
Proceedings of the 11th International Network Optimization Conference, 2024
2023
Exact solution approaches for the discrete <i>α</i>-neighbor <i>p</i>-center problem.
Networks, December, 2023
2022
INFORMS J. Comput., 2022
Eur. J. Oper. Res., 2022
A scaleable projection-based branch-and-cut algorithm for the <i>p</i>-center problem.
Eur. J. Oper. Res., 2022
Comput. Oper. Res., 2022
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022
2021
Mixed-integer programming approaches for the time-constrained maximal covering routing problem.
OR Spectr., 2021
Eur. J. Oper. Res., 2021
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res., 2021
CoRR, 2021
Experiments with graph convolutional networks for solving the vertex p-center problem.
CoRR, 2021
Comput. Oper. Res., 2021
Central Eur. J. Oper. Res., 2021
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021
2020
Ann. Oper. Res., 2020
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020
2019
Optim. Lett., 2019
Int. Trans. Oper. Res., 2019
INFORMS J. Comput., 2019
Comput. Oper. Res., 2019
2018
Optim. Lett., 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
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
Comput. Optim. Appl., 2018
2017
Math. Program. Comput., 2017
Manag. Sci., 2017
Oper. Res., 2017
Eur. J. Oper. Res., 2017
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res., 2017
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems.
Comput. Oper. Res., 2017
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
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
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
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015
2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
2013
Electron. Notes Discret. Math., 2013
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013