Markus Sinnl

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 60

Top Topics

Facility Location

Benders Decomposition

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

INFORMS J. Comput.

Publications

Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
A matheuristic for tri-objective binary integer linear programming. Comput. Oper. Res. 161 (2024)
Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. Comput. Oper. Res. 167 (2024)
Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis
Competing for the most profitable tour: The orienteering interdiction game. CoRR (2024)
Christof Brandstetter, Markus Sinnl
On the nested p-center problem. INOC (2024)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206 (1) (2024)
Elisabeth Gaar, Markus Sinnl
-center problem. Networks 82 (4) (2023)
Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. CoRR (2023)
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
An exact method for binary fortification games. Eur. J. Oper. Res. 307 (3) (2023)
Kübra Taninmis, Markus Sinnl
A Branch-and-Cut Algorithm for Submodular Interdiction Games. INFORMS J. Comput. 34 (5) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO (2022)
Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
A matheuristic for tri-objective binary integer programming. CoRR (2022)
Markus Sinnl
An iterative exact algorithm for the weighted fair sequences problem. Comput. Oper. Res. 148 (2022)
Elisabeth Gaar, Markus Sinnl
-center problem. Eur. J. Oper. Res. 303 (1) (2022)
Elisabeth Gaar, Markus Sinnl
Exact solution approaches for the discrete α-neighbor p-center problem. CoRR (2022)
Markus Sinnl
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem. Eur. J. Oper. Res. 298 (3) (2022)
Milos Chromý, Markus Sinnl
On Solving the Minimum Common String Partition Problem by Decision Diagrams. ICORES (2022)
Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl
Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289 (1) (2021)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR (2021)
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. Eur. J. Oper. Res. 289 (3) (2021)
Eduardo Álvarez-Miranda, Markus Sinnl
Exact and heuristic algorithms for the weighted total domination problem. Comput. Oper. Res. 127 (2021)
Elisabeth Gaar, Markus Sinnl
A scaleable projection-based branch-and-cut algorithm for the p-center problem. CoRR (2021)
Markus Sinnl
Mixed-integer programming approaches for the time-constrained maximal covering routing problem. OR Spectr. 43 (2) (2021)
Milos Chromý, Markus Sinnl
On Solving the Minimum Common String Partition Problem by Decision Diagrams. CoRR (2021)
Markus Sinnl
A note on computational approaches for the antibandwidth problem. Central Eur. J. Oper. Res. 29 (3) (2021)
Elisabeth Gaar, Markus Sinnl
Experiments with graph convolutional networks for solving the vertex p-center problem. CoRR (2021)
Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
A LP Relaxation based Matheuristic for Multi-objective Integer Programming. ICORES (2021)
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
An Exact Method for Fortification Games. CoRR (2021)
Eduardo Álvarez-Miranda, Markus Sinnl
A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. 284 (2) (2020)
Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie N. Parragh
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. CPAIOR (2020)
Eduardo Álvarez-Miranda, Markus Sinnl
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. Optim. Lett. 13 (7) (2019)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31 (2) (2019)
Markus Sinnl
A note on computational approaches for the antibandwidth problem. CoRR (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
An exact solution framework for the multiple gradual cover location problem. Comput. Oper. Res. 108 (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
A note on computational aspects of the Steiner traveling salesman problem. Int. Trans. Oper. Res. 26 (4) (2019)
Markus Sinnl
Algorithmic expedients for the S-labeling problem. CoRR (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
An exact solution framework for the multiple gradual cover location problem. CoRR (2019)
Markus Sinnl
-labeling problem. Comput. Oper. Res. 108 (2019)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
On the use of intersection cuts for bilevel optimization. Math. Program. 172 (1-2) (2018)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. 30 (2) (2018)
Robert Fritze, Anita Graser, Markus Sinnl
Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria. Int. J. Medical Informatics 111 (2018)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69 (3) (2018)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
The connected facility location polytope. Discret. Appl. Math. 234 (2018)
Matteo Fischetti, Michele Monaci, Markus Sinnl
A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. 267 (1) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12 (7) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265 (2) (2018)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63 (7) (2017)
Eduardo Álvarez-Miranda, Hesso Farhan, Martin Luipersbeck, Markus Sinnl
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. Ann. Oper. Res. 258 (1) (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65 (6) (2017)
Eduardo Álvarez-Miranda, Markus Sinnl
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. Comput. Oper. Res. 87 (2017)
Eduardo Álvarez-Miranda, Markus Sinnl
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. Comput. Oper. Res. 83 (2017)
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9 (2) (2017)
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258 (3) (2017)
Fabio Furini, Ivana Ljubic, Markus Sinnl
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262 (2) (2017)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. 261 (1) (2017)
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
Intersection Cuts for Bilevel Optimization. IPCO (2016)
Markus Sinnl, Ivana Ljubic
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Math. Program. Comput. 8 (4) (2016)
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. 72 (2016)
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253 (3) (2016)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. CPAIOR (2016)
Markus Leitner, Ivana Ljubic, Markus Sinnl
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. INFORMS J. Comput. 27 (1) (2015)
Fabio Furini, Ivana Ljubic, Markus Sinnl
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR (2015)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
On the Asymmetric Connected Facility Location Polytope. ISCO (2014)
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. 41 (2013)
Markus Leitner, Ivana Ljubic, Markus Sinnl
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. 41 (2013)