Markus Sinnl

Proceedings of the 11th International Network Optimization Conference, 2024

2023

Exact solution approaches for the discrete α-neighbor p-center problem.

[BibT_eX]

[DOI]

Networks, December, 2023

An exact method for binary fortification games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., June, 2023

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.

[BibT_eX]

[DOI]

CoRR, 2023

2022

A Branch-and-Cut Algorithm for Submodular Interdiction Games.

[BibT_eX]

[DOI]

Kübra Taninmis

INFORMS J. Comput., 2022

Exact and heuristic algorithms for the maximum weighted submatrix coverage problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Exact solution approaches for the discrete α-neighbor p-center problem.

[BibT_eX]

[DOI]

CoRR, 2022

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

[BibT_eX]

[DOI]

CoRR, 2022

A matheuristic for tri-objective binary integer programming.

[BibT_eX]

[DOI]

CoRR, 2022

An iterative exact algorithm for the weighted fair sequences problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

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

[BibT_eX]

[DOI]

Milos Chromý

Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021

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

[BibT_eX]

[DOI]

OR Spectr., 2021

Large-scale influence maximization via maximal covering location.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.

[BibT_eX]

[DOI]

Marcos Goycoolea

Eur. J. Oper. Res., 2021

An Exact Method for Fortification Games.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Exact and heuristic algorithms for the weighted total domination problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

A note on computational approaches for the antibandwidth problem.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2021

A LP Relaxation based Matheuristic for Multi-objective Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020

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

[BibT_eX]

[DOI]

Ann. Oper. Res., 2020

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

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019

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

[BibT_eX]

[DOI]

Optim. Lett., 2019

A note on computational aspects of the Steiner traveling salesman problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2019

Interdiction Games and Monotonicity, with Application to Knapsack Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

Algorithmic expedients for the S-labeling problem.

[BibT_eX]

[DOI]

CoRR, 2019

Algorithmic expedients for the S-labeling problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

An exact solution framework for the multiple gradual cover location problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

2018

An exact solution framework for the minimum cost dominating tree problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

On the use of intersection cuts for bilevel optimization.

[BibT_eX]

[DOI]

Math. Program., 2018

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2018

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

[BibT_eX]

[DOI]

Robert Fritze

Anita Graser

Int. J. Medical Informatics, 2018

A dynamic reformulation heuristic for Generalized Interdiction Problems.

[BibT_eX]

[DOI]

Matteo Fischetti

Michele Monaci

Eur. J. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

The connected facility location polytope.

[BibT_eX]

[DOI]

Juan José Salazar González

Discret. Appl. Math., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

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

[BibT_eX]

[DOI]

Math. Program. Comput., 2017

Redesigning Benders Decomposition for Large-Scale Facility Location.

[BibT_eX]

[DOI]

Matteo Fischetti

Manag. Sci., 2017

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

[BibT_eX]

[DOI]

Oper. Res., 2017

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

[BibT_eX]

[DOI]

Juan José Salazar González

Eur. J. Oper. Res., 2017

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

[BibT_eX]

[DOI]

Fabio Furini

Eur. J. Oper. Res., 2017

Solving minimum-cost shared arborescence problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

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

[BibT_eX]

[DOI]

Hesso Farhan

Ann. Oper. Res., 2017

2016

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

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

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

[BibT_eX]

[DOI]

Matteo Fischetti

Eur. J. Oper. Res., 2016

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

Intersection Cuts for Bilevel Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Optimal Upgrading Schemes for Effective Shortest Paths in Networks.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2015

ILP and CP Formulations for the Lazy Bureaucrat Problem.

[BibT_eX]

[DOI]

Fabio Furini

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

On the Asymmetric Connected Facility Location Polytope.

[BibT_eX]

[DOI]

Juan José Salazar González

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

On the Two-Architecture Connected Facility Location Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

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

[BibT_eX]

[DOI]