Markus Sinnl

发表

On the use of intersection cuts for bilevel optimization

Matteo Fischetti, Michele Monaci, Ivana Ljubic, 2017, Mathematical Programming.

A branch-and-cut algorithm for the maximum covering cycle problem

Markus Sinnl, Eduardo Álvarez-Miranda, 2020, Ann. Oper. Res..

Solving minimum-cost shared arborescence problems

Ivana Ljubic, Markus Sinnl, Eduardo Álvarez-Miranda, 2017, Eur. J. Oper. Res..

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2018, INFORMS J. Comput..

Interdiction Games and Monotonicity, with Application to Knapsack Problems

Matteo Fischetti, Michele Monaci, Ivana Ljubic, 2019, INFORMS J. Comput..

On the Two-Architecture Connected Facility Location Problem

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2013, Electron. Notes Discret. Math..

An exact solution framework for the multiple gradual cover location problem

Markus Sinnl, Eduardo Álvarez-Miranda, Eduardo Álvarez-Miranda, 2019, Comput. Oper. Res..

Intersection Cuts for Bilevel Optimization

Matteo Fischetti, Michele Monaci, Ivana Ljubic, 2016, IPCO.

Exact and heuristic algorithms for the weighted total domination problem

Markus Sinnl, Eduardo 'Alvarez-Miranda, Eduardo Álvarez-Miranda, 2019, Comput. Oper. Res..

Algorithmic expedients for the S-labeling problem pdf

Markus Sinnl, 2019, Comput. Oper. Res..

Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem

Markus Sinnl, Sophie N. Parragh, Armin Biere, 2020, CPAIOR.

On the Asymmetric Connected Facility Location Polytope

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2014, ISCO.

An exact solution framework for the minimum cost dominating tree problem

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2018, Optim. Lett..

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2013, Electron. Notes Discret. Math..

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2018, Eur. J. Oper. Res..

Decomposition methods for the two-stage stochastic Steiner tree problem

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2018, Comput. Optim. Appl..

Benders decomposition without separability: A computational study for capacitated facility location problems

Matteo Fischetti, Ivana Ljubic, Markus Sinnl, 2016, Eur. J. Oper. Res..

A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems

Markus Sinnl, Eduardo Álvarez-Miranda, Eduardo Álvarez-Miranda, 2017, Comput. Oper. Res..

Thinning out Steiner trees: a node-based model for uniform edge costs

Matteo Fischetti, Michele Monaci, Markus Leitner, 2017, Math. Program. Comput..

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

Matteo Fischetti, Michele Monaci, Ivana Ljubic, 2017, Oper. Res..

Mixed-integer programming approaches for the tree $$t^*$$t∗-spanner problem

Markus Sinnl, Eduardo Álvarez-Miranda, Eduardo Álvarez-Miranda, 2018, Optim. Lett..

Redesigning Benders Decomposition for Large-Scale Facility Location

Matteo Fischetti, Ivana Ljubic, Markus Sinnl, 2017, Manag. Sci..

The connected facility location polytope

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2018, Discret. Appl. Math..

A note on computational approaches for the antibandwidth problem pdf

Markus Sinnl, 2019, ArXiv.

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2016, Annals of Operations Research.

Large-scale influence maximization via maximal covering location

Markus Leitner, Markus Sinnl, Mario Ruthmair, 2021, Eur. J. Oper. Res..

An algorithmic framework for the exact solution of tree-star problems

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2017, Eur. J. Oper. Res..

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Ivana Ljubic, Markus Sinnl, Fabio Furini, 2017, Eur. J. Oper. Res..

Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria

Anita Graser, Markus Sinnl, Robert Fritze, 2018, Int. J. Medical Informatics.

A note on computational aspects of the Steiner traveling salesman problem

Markus Sinnl, Eduardo Álvarez-Miranda, Eduardo Álvarez-Miranda, 2018, Int. Trans. Oper. Res..

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2015, INFORMS J. Comput..

A dynamic reformulation heuristic for Generalized Interdiction Problems

Matteo Fischetti, Michele Monaci, Markus Sinnl, 2017, Eur. J. Oper. Res..

Optimal Upgrading Schemes for Effective Shortest Paths in Networks

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2016, CPAIOR.

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems

Markus Sinnl, Eduardo Álvarez-Miranda, Eduardo Álvarez-Miranda, 2017, Comput. Oper. Res..

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2016, Comput. Oper. Res..

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements

Markus Sinnl, Marcos Goycoolea, Eduardo 'Alvarez-Miranda, 2019, Eur. J. Oper. Res..

ILP and CP Formulations for the Lazy Bureaucrat Problem

Ivana Ljubic, Markus Sinnl, Fabio Furini, 2015, CPAIOR.

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

Ivana Ljubic, Markus Sinnl, I. Ljubić, 2016, Math. Program. Comput..

Benders decomposition for competitive influence maximization in (social) networks

Markus Leitner, Markus Sinnl, Mario Ruthmair, 2020, Omega.

An outer approximation algorithm for multiobjective mixed-integer linear programming

Markus Sinnl, Sophie N. Parragh, Fabien Tricoire, 2021 .

A LP Relaxation based Matheuristic for Multi-objective Integer Programming

Markus Sinnl, Sophie N. Parragh, Fabien Tricoire, 2021, ICORES.

Experiments with graph convolutional networks for solving the vertex p-center problem pdf

Markus Sinnl, Elisabeth Gaar, 2021, ArXiv.

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs pdf

Markus Sinnl, Elisabeth Gaar, Kübra Taninmis, 2021, ArXiv.

On Solving the Minimum Common String Partition Problem by Decision Diagrams pdf

Markus Sinnl, Milovs Chrom'y, 2021, ArXiv.

A scaleable projection-based branch-and-cut algorithm for the p-center problem pdf

Markus Sinnl, Elisabeth Gaar, 2021, ArXiv.

An Exact Method for Fortification Games pdf

Michele Monaci, Markus Leitner, Ivana Ljubic, 2021, ArXiv.

A branch-and-cut algorithm for submodular interdiction games

Markus Sinnl, Kubra Taninmics, 2021 .

Exact and heuristic algorithms for the maximum weighted submatrix coverage problem

Markus Sinnl, Markus Sinnl, 2021, Eur. J. Oper. Res..

Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Markus Sinnl, 2021, OR Spectr..

An iterative exact algorithm for the weighted fair sequences problem

Markus Sinnl, Markus Sinnl, 2021, Comput. Oper. Res..

A New Layered Graph Approach to Hop-and Diameter-constrained Spanning / Steiner Tree Problems in Graphs

Markus Sinnl, Ivana Ljubić, 2014 .

Branch-and-Price for the Steiner Tree Problem with Revenues , Budget and Hop Constraints

Markus Sinnl, Verfassung der Arbeit, Markus Sinnl, 2011 .