Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. - Markus Leitner; Ivana Ljubic; Markus Sinnl (Electron. Notes Discret. Math., 2013)

On the Two-Architecture Connected Facility Location Problem. - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Electron. Notes Discret. Math., 2013)

On the Asymmetric Connected Facility Location Polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (ISCO, 2014)

ILP and CP Formulations for the Lazy Bureaucrat Problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (CPAIOR, 2015)

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. - Markus Leitner; Ivana Ljubic; Markus Sinnl (INFORMS J. Comput., 2015)

Optimal Upgrading Schemes for Effective Shortest Paths in Networks. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (CPAIOR, 2016)

Intersection Cuts for Bilevel Optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (IPCO, 2016)

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Comput. Oper. Res., 2016)

Benders decomposition without separability: A computational study for capacitated facility location problems. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2016)

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. - Markus Sinnl; Ivana Ljubic (Math. Program. Comput., 2016)

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. - Eduardo Álvarez-Miranda; Hesso Farhan; Martin Luipersbeck; Markus Sinnl (Ann. Oper. Res., 2017)

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2017)

A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2017)

Solving minimum-cost shared arborescence problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2017)

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2017)

An algorithmic framework for the exact solution of tree-star problems. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Eur. J. Oper. Res., 2017)

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Oper. Res., 2017)

Redesigning Benders Decomposition for Large-Scale Facility Location. - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Manag. Sci., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs. - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

Decomposition methods for the two-stage stochastic Steiner tree problem. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Comput. Optim. Appl., 2018)

The connected facility location polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Discret. Appl. Math., 2018)

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2018)

A dynamic reformulation heuristic for Generalized Interdiction Problems. - Matteo Fischetti; Michele Monaci; Markus Sinnl (Eur. J. Oper. Res., 2018)

Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria. - Robert Fritze; Anita Graser; Markus Sinnl (Int. J. Medical Informatics, 2018)

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (INFORMS J. Comput., 2018)

On the use of intersection cuts for bilevel optimization. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Math. Program., 2018)

An exact solution framework for the minimum cost dominating tree problem. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Optim. Lett., 2018)

An exact solution framework for the multiple gradual cover location problem. - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2019)

Algorithmic expedients for the S-labeling problem. - Markus Sinnl (Comput. Oper. Res., 2019)

Algorithmic expedients for the S-labeling problem. - Markus Sinnl (CoRR, 2019)

Interdiction Games and Monotonicity, with Application to Knapsack Problems. - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (INFORMS J. Comput., 2019)

A note on computational aspects of the Steiner traveling salesman problem. - Eduardo Álvarez-Miranda; Markus Sinnl (Int. Trans. Oper. Res., 2019)

Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. - Eduardo Álvarez-Miranda; Markus Sinnl (Optim. Lett., 2019)

Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. - Katalin Fazekas; Markus Sinnl; Armin Biere; Sophie N. Parragh (CPAIOR, 2020)

A branch-and-cut algorithm for the maximum covering cycle problem. - Eduardo Álvarez-Miranda; Markus Sinnl (Ann. Oper. Res., 2020)

A LP Relaxation based Matheuristic for Multi-objective Integer Programming. - Duleabom An; Sophie N. Parragh; Markus Sinnl; Fabien Tricoire (ICORES, 2021)

A note on computational approaches for the antibandwidth problem. - Markus Sinnl (Central Eur. J. Oper. Res., 2021)

Exact and heuristic algorithms for the weighted total domination problem. - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2021)

Experiments with graph convolutional networks for solving the vertex p-center problem. - Elisabeth Gaar; Markus Sinnl (CoRR, 2021)

A scaleable projection-based branch-and-cut algorithm for the p-center problem. - Elisabeth Gaar; Markus Sinnl (CoRR, 2021)

An Exact Method for Fortification Games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. - Eduardo Álvarez-Miranda; Marcos Goycoolea; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2021)

Large-scale influence maximization via maximal covering location. - Evren Güney; Markus Leitner; Mario Ruthmair; Markus Sinnl (Eur. J. Oper. Res., 2021)

Mixed-integer programming approaches for the time-constrained maximal covering routing problem. - Markus Sinnl (OR Spectr., 2021)

On Solving the Minimum Common String Partition Problem by Decision Diagrams. - Milos Chromý; Markus Sinnl (ICORES, 2022)

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (IPCO, 2022)

An iterative exact algorithm for the weighted fair sequences problem. - Markus Sinnl (Comput. Oper. Res., 2022)

A matheuristic for tri-objective binary integer programming. - Duleabom An; Sophie N. Parragh; Markus Sinnl; Fabien Tricoire (CoRR, 2022)

Exact solution approaches for the discrete α-neighbor p-center problem. - Elisabeth Gaar; Markus Sinnl (CoRR, 2022)

A scaleable projection-based branch-and-cut algorithm for the p-center problem. - Elisabeth Gaar; Markus Sinnl (Eur. J. Oper. Res., 2022)

Exact and heuristic algorithms for the maximum weighted submatrix coverage problem. - Markus Sinnl (Eur. J. Oper. Res., 2022)

A Branch-and-Cut Algorithm for Submodular Interdiction Games. - Kübra Taninmis; Markus Sinnl (INFORMS J. Comput., 2022)

An exact method for binary fortification games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (Eur. J. Oper. Res., 2023)

Exact solution approaches for the discrete α-neighbor p-center problem. - Elisabeth Gaar; Markus Sinnl (Networks, 2023)

On the nested p-center problem. - Christof Brandstetter; Markus Sinnl (INOC, 2024)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. - Kübra Taninmis; Necati Aras; Evren Güney; Markus Sinnl (Comput. Oper. Res., 2024)

Competing for the most profitable tour: The orienteering interdiction game. - Eduardo Álvarez-Miranda; Markus Sinnl; Kübra Taninmis (CoRR, 2024)

Mixed-integer linear programming approaches for nested p-center problems with absolute and relative regret objectives. - Christof Brandstetter; Markus Sinnl (CoRR, 2024)

Recent advances in exact optimization methods for OR applications - Special issue editorial. - Markus Sinnl (EURO J. Comput. Optim., 2024)

A matheuristic for tri-objective binary integer linear programming. - Duleabom An; Sophie N. Parragh; Markus Sinnl; Fabien Tricoire (Comput. Oper. Res., 2024)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Math. Program., 2024)

An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. - Fritz Bökler; Sophie N. Parragh; Markus Sinnl; Fabien Tricoire (Math. Methods Oper. Res., 2024)

A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service. - Eduardo Álvarez-Miranda; Rafael Epstein; Jordi Pereira; Markus Sinnl; Rodolfo Urrutia (Comput. Oper. Res., 2025)