Markus Sinnl

73 papers B 5C 4Journal 64
YearRankTypeTitle / Venue / Authors
2026 J jnl
A matheuristic for solving the single row facility layout problem.
Comput. Oper. Res.
Thomas Pammer, Markus Sinnl
2026 J jnl
Competing for the most profitable tour: the orienteering interdiction game.
Comput. Ind. Eng.
Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis
2026 J jnl
Investigating mixed-integer programming approaches for the p-α-closest-center problem.
CoRR
Elisabeth Gaar, Sara Joosten, Markus Sinnl
2026 J jnl
Mixed-Integer Linear Programming Approaches for Nested p$$ p $$-Center Problems With Absolute and Relative Regret Objectives.
Networks
Christof Brandstetter, Markus Sinnl
2025 J jnl
A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service.
Comput. Oper. Res.
Eduardo Álvarez-Miranda, Rafael Epstein, Jordi Pereira, Markus Sinnl, Rodolfo Urrutia
2024 J jnl
A matheuristic for tri-objective binary integer linear programming.
Comput. Oper. Res.
Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
2024 J jnl
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems.
Math. Methods Oper. Res.
Fritz Bökler, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
2024 J jnl
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.
Comput. Oper. Res.
Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
2024 J jnl
Competing for the most profitable tour: The orienteering interdiction game.
CoRR
Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis
2024 J jnl
Mixed-integer linear programming approaches for nested
CoRR
Christof Brandstetter, Markus Sinnl
2024 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program.
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2024 C conf
On the nested p-center problem.
INOC
Christof Brandstetter, Markus Sinnl
2024 J jnl
Recent advances in exact optimization methods for OR applications - Special issue editorial.
EURO J. Comput. Optim.
Markus Sinnl
2023 J jnl
An exact method for binary fortification games.
Eur. J. Oper. Res.
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2023 J jnl
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.
CoRR
Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
2023 J jnl
Exact solution approaches for the discrete
Networks
Elisabeth Gaar, Markus Sinnl
2022 J jnl
A Branch-and-Cut Algorithm for Submodular Interdiction Games.
INFORMS J. Comput.
Kübra Taninmis, Markus Sinnl
2022 J jnl
A matheuristic for tri-objective binary integer programming.
CoRR
Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
2022 J jnl
A scaleable projection-based branch-and-cut algorithm for the
Eur. J. Oper. Res.
Elisabeth Gaar, Markus Sinnl
2022 J jnl
An iterative exact algorithm for the weighted fair sequences problem.
Comput. Oper. Res.
Markus Sinnl
2022 J jnl
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem.
Eur. J. Oper. Res.
Markus Sinnl
2022 J jnl
Exact solution approaches for the discrete α-neighbor p-center problem.
CoRR
Elisabeth Gaar, Markus Sinnl
2022 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2022 C conf
On Solving the Minimum Common String Partition Problem by Decision Diagrams.
ICORES
Milos Chromý, Markus Sinnl
2022 B conf
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.
IPCO
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2021 C conf
A LP Relaxation based Matheuristic for Multi-objective Integer Programming.
ICORES
Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire
2021 J jnl
A note on computational approaches for the antibandwidth problem.
Central Eur. J. Oper. Res.
Markus Sinnl
2021 J jnl
A scaleable projection-based branch-and-cut algorithm for the p-center problem.
CoRR
Elisabeth Gaar, Markus Sinnl
2021 J jnl
An Exact Method for Fortification Games.
CoRR
Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2021 J jnl
Exact and heuristic algorithms for the weighted total domination problem.
Comput. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2021 J jnl
Experiments with graph convolutional networks for solving the vertex p-center problem.
CoRR
Elisabeth Gaar, Markus Sinnl
2021 J jnl
Large-scale influence maximization via maximal covering location.
Eur. J. Oper. Res.
Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl
2021 J jnl
Mixed-integer programming approaches for the time-constrained maximal covering routing problem.
OR Spectr.
Markus Sinnl
2021 J jnl
On Solving the Minimum Common String Partition Problem by Decision Diagrams.
CoRR
Milos Chromý, Markus Sinnl
2021 J jnl
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2021 J jnl
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl
2020 J jnl
A branch-and-cut algorithm for the maximum covering cycle problem.
Ann. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2020 B conf
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem.
CPAIOR
Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie N. Parragh
2019 J jnl
A note on computational approaches for the antibandwidth problem.
CoRR
Markus Sinnl
2019 J jnl
A note on computational aspects of the Steiner traveling salesman problem.
Int. Trans. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2019 J jnl
Algorithmic expedients for the
Comput. Oper. Res.
Markus Sinnl
2019 J jnl
Algorithmic expedients for the S-labeling problem.
CoRR
Markus Sinnl
2019 J jnl
An exact solution framework for the multiple gradual cover location problem.
Comput. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2019 J jnl
An exact solution framework for the multiple gradual cover location problem.
CoRR
Eduardo Álvarez-Miranda, Markus Sinnl
2019 J jnl
Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2019 J jnl
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem.
Optim. Lett.
Eduardo Álvarez-Miranda, Markus Sinnl
2018 J jnl
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput.
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018 J jnl
A dynamic reformulation heuristic for Generalized Interdiction Problems.
Eur. J. Oper. Res.
Matteo Fischetti, Michele Monaci, Markus Sinnl
2018 J jnl
An exact solution framework for the minimum cost dominating tree problem.
Optim. Lett.
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
2018 J jnl
Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria.
Int. J. Medical Informatics
Robert Fritze, Anita Graser, Markus Sinnl
2018 J jnl
Decomposition methods for the two-stage stochastic Steiner tree problem.
Comput. Optim. Appl.
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018 J jnl
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
2018 J jnl
On the use of intersection cuts for bilevel optimization.
Math. Program.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2018 J jnl
The connected facility location polytope.
Discret. Appl. Math.
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017 J jnl
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2017 J jnl
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems.
Comput. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2017 J jnl
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death.
Ann. Oper. Res.
Eduardo Álvarez-Miranda, Hesso Farhan, Martin Luipersbeck, Markus Sinnl
2017 J jnl
An algorithmic framework for the exact solution of tree-star problems.
Eur. J. Oper. Res.
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017 J jnl
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Markus Sinnl
2017 J jnl
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems.
Comput. Oper. Res.
Eduardo Álvarez-Miranda, Markus Sinnl
2017 J jnl
Redesigning Benders Decomposition for Large-Scale Facility Location.
Manag. Sci.
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2017 J jnl
Solving minimum-cost shared arborescence problems.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2017 J jnl
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput.
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2016 J jnl
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.
Math. Program. Comput.
Markus Sinnl, Ivana Ljubic
2016 J jnl
Benders decomposition without separability: A computational study for capacitated facility location problems.
Eur. J. Oper. Res.
Matteo Fischetti, Ivana Ljubic, Markus Sinnl
2016 J jnl
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res.
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2016 B conf
Intersection Cuts for Bilevel Optimization.
IPCO
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2016 B conf
Optimal Upgrading Schemes for Effective Shortest Paths in Networks.
CPAIOR
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
2015 J jnl
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput.
Markus Leitner, Ivana Ljubic, Markus Sinnl
2015 B conf
ILP and CP Formulations for the Lazy Bureaucrat Problem.
CPAIOR
Fabio Furini, Ivana Ljubic, Markus Sinnl
2014 C conf
On the Asymmetric Connected Facility Location Polytope.
ISCO
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2013 J jnl
On the Two-Architecture Connected Facility Location Problem.
Electron. Notes Discret. Math.
Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2013 J jnl
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math.
Markus Leitner, Ivana Ljubic, Markus Sinnl