default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Sinnl
Person information
- affiliation: Johannes Kepler University, Linz, Austria
- affiliation (former): University of Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j45]Eduardo Álvarez-Miranda
, Rafael Epstein, Jordi Pereira, Markus Sinnl, Rodolfo Urrutia:
A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service. Comput. Oper. Res. 173: 106845 (2025)- 2024
- [j44]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A matheuristic for tri-objective binary integer linear programming. Comput. Oper. Res. 161: 106397 (2024) - [j43]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: 106675 (2024) - [j42]Fritz Bökler, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. Math. Methods Oper. Res. 100(1): 263-290 (2024) - [j41]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): 91-124 (2024) - [c9]Christof Brandstetter, Markus Sinnl:
On the nested p-center problem. INOC 2024: 28-33 - [i14]Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis:
Competing for the most profitable tour: The orienteering interdiction game. CoRR abs/2407.02959 (2024) - [i13]Christof Brandstetter, Markus Sinnl:
Mixed-integer linear programming approaches for nested p-center problems with absolute and relative regret objectives. CoRR abs/2409.11346 (2024) - 2023
- [j40]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An exact method for binary fortification games. Eur. J. Oper. Res. 307(3): 1026-1039 (2023) - [j39]Elisabeth Gaar, Markus Sinnl:
Exact solution approaches for the discrete α-neighbor p-center problem. Networks 82(4): 371-399 (2023) - [i12]Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl:
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. CoRR abs/2303.12402 (2023) - 2022
- [j38]Markus Sinnl:
An iterative exact algorithm for the weighted fair sequences problem. Comput. Oper. Res. 148: 106017 (2022) - [j37]Markus Sinnl:
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem. Eur. J. Oper. Res. 298(3): 821-833 (2022) - [j36]Elisabeth Gaar, Markus Sinnl:
A scaleable projection-based branch-and-cut algorithm for the p-center problem. Eur. J. Oper. Res. 303(1): 78-98 (2022) - [j35]Kübra Taninmis, Markus Sinnl:
A Branch-and-Cut Algorithm for Submodular Interdiction Games. INFORMS J. Comput. 34(5): 2634-2657 (2022) - [c8]Milos Chromý, Markus Sinnl:
On Solving the Minimum Common String Partition Problem by Decision Diagrams. ICORES 2022: 177-184 - [c7]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: 262-276 - [i11]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A matheuristic for tri-objective binary integer programming. CoRR abs/2205.03386 (2022) - [i10]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 abs/2207.05014 (2022) - [i9]Elisabeth Gaar, Markus Sinnl:
Exact solution approaches for the discrete α-neighbor p-center problem. CoRR abs/2211.12908 (2022) - 2021
- [j34]Markus Sinnl:
A note on computational approaches for the antibandwidth problem. Central Eur. J. Oper. Res. 29(3): 1057-1077 (2021) - [j33]Eduardo Álvarez-Miranda, Markus Sinnl:
Exact and heuristic algorithms for the weighted total domination problem. Comput. Oper. Res. 127: 105157 (2021) - [j32]Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl:
Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289(1): 144-164 (2021) - [j31]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): 1013-1029 (2021) - [j30]Markus Sinnl:
Mixed-integer programming approaches for the time-constrained maximal covering routing problem. OR Spectr. 43(2): 497-542 (2021) - [c6]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A LP Relaxation based Matheuristic for Multi-objective Integer Programming. ICORES 2021: 88-98 - [i8]Elisabeth Gaar, Markus Sinnl:
Experiments with graph convolutional networks for solving the vertex p-center problem. CoRR abs/2106.00357 (2021) - [i7]Elisabeth Gaar, Markus Sinnl:
A scaleable projection-based branch-and-cut algorithm for the p-center problem. CoRR abs/2108.07045 (2021) - [i6]Milos Chromý, Markus Sinnl:
On Solving the Minimum Common String Partition Problem by Decision Diagrams. CoRR abs/2110.05168 (2021) - [i5]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR abs/2111.06824 (2021) - [i4]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An Exact Method for Fortification Games. CoRR abs/2111.13400 (2021) - 2020
- [j29]Eduardo Álvarez-Miranda, Markus Sinnl:
A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. 284(2): 487-499 (2020) - [c5]Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie N. Parragh:
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. CPAIOR 2020: 186-204
2010 – 2019
- 2019
- [j28]Eduardo Álvarez-Miranda, Markus Sinnl:
An exact solution framework for the multiple gradual cover location problem. Comput. Oper. Res. 108: 82-96 (2019) - [j27]Markus Sinnl:
Algorithmic expedients for the S-labeling problem. Comput. Oper. Res. 108: 201-212 (2019) - [j26]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31(2): 390-410 (2019) - [j25]Eduardo Álvarez-Miranda, Markus Sinnl:
A note on computational aspects of the Steiner traveling salesman problem. Int. Trans. Oper. Res. 26(4): 1396-1401 (2019) - [j24]Eduardo Álvarez-Miranda, Markus Sinnl:
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. Optim. Lett. 13(7): 1693-1709 (2019) - [i3]Markus Sinnl:
Algorithmic expedients for the S-labeling problem. CoRR abs/1909.04463 (2019) - [i2]Eduardo Álvarez-Miranda, Markus Sinnl:
An exact solution framework for the multiple gradual cover location problem. CoRR abs/1909.04910 (2019) - [i1]Markus Sinnl:
A note on computational approaches for the antibandwidth problem. CoRR abs/1910.03367 (2019) - 2018
- [j23]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69(3): 713-752 (2018) - [j22]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
The connected facility location polytope. Discret. Appl. Math. 234: 151-167 (2018) - [j21]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265(2): 779-794 (2018) - [j20]Matteo Fischetti, Michele Monaci, Markus Sinnl:
A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. 267(1): 40-51 (2018) - [j19]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: 24-36 (2018) - [j18]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): 402-420 (2018) - [j17]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
On the use of intersection cuts for bilevel optimization. Math. Program. 172(1-2): 77-103 (2018) - [j16]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12(7): 1669-1681 (2018) - 2017
- [j15]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): 5-30 (2017) - [j14]Eduardo Álvarez-Miranda, Markus Sinnl:
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. Comput. Oper. Res. 83: 13-27 (2017) - [j13]Eduardo Álvarez-Miranda, Markus Sinnl:
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. Comput. Oper. Res. 87: 63-82 (2017) - [j12]Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258(3): 887-901 (2017) - [j11]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): 54-66 (2017) - [j10]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): 438-448 (2017) - [j9]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65(6): 1615-1637 (2017) - [j8]Matteo Fischetti, Ivana Ljubic, Markus Sinnl:
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63(7): 2146-2162 (2017) - [j7]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): 203-229 (2017) - 2016
- [j6]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: 128-146 (2016) - [j5]Matteo Fischetti, Ivana Ljubic, Markus Sinnl:
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3): 557-569 (2016) - [j4]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): 461-490 (2016) - [c4]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. CPAIOR 2016: 406-420 - [c3]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Intersection Cuts for Bilevel Optimization. IPCO 2016: 77-88 - 2015
- [j3]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): 118-134 (2015) - [c2]Fabio Furini, Ivana Ljubic, Markus Sinnl:
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR 2015: 255-270 - 2014
- [c1]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
On the Asymmetric Connected Facility Location Polytope. ISCO 2014: 371-383 - 2013
- [j2]Markus Leitner, Ivana Ljubic, Markus Sinnl:
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. 41: 181-188 (2013) - [j1]Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. 41: 359-366 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
