16 citations · 54 across the 22 of their papers we have counts for
26 papers
Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming
Thomas Pammer, Johannes Fürnkranz, Markus Sinnl
We study the problem of learning accurate and cognitively simple binary classifiers that are directly interpretable as Boolean rules. We propose mixed integer linear programming (M…
On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts
Kübra Tanınmış, Elisabeth Gaar, Jon Lee +2
In this work, we study bilevel optimization problems where all variables are integer, all constraints and the leader objective function are linear, and the follower objective funct…
An semidefinite programming-based -constraint method for the bi-objective single-row facility layout problem
Christof Brandstetter, Elisabeth Gaar, Markus Sinnl
In this work, we introduce a multi-objective version of the well-known single-row facility layout problem (SRFLP). In the SRFLP, a set of one-dimensional facilities should be place…
A note on the maximal covering location problem with customer preference ordering
Elisabeth Gaar, Markus Sinnl
Recently a series of papers introduced and investigated the maximal covering location problem with customer preference ordering, a variant of the classical maximal covering locatio…
Investigating mixed-integer programming approaches for the --closest-center problem
Elisabeth Gaar, Sara Joosten, Markus Sinnl
In this work, we introduce and study the --closest-center problem (CCP), which generalizes the -second-center problem, a recently emerged variant of the classical -…
A matheuristic for solving the single row facility layout problem
Thomas Pammer, Markus Sinnl
The single row facility layout problem (SRFLP) is a well-studied NP-hard combinatorial optimization problem with applications in manufacturing and logistics systems. In the SRFLP,…