4 papers
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 $p…
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,…