9 citations · 11 across the 6 of their papers we have counts for
8 papers · 1 filter
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 -…
An exact approach for the multi-depot electric vehicle scheduling problem
Xenia Haslinger, Elisabeth Gaar, Sophie N. Parragh
The "avoid - shift - improve" framework and the European Clean Vehicles Directive set the path for improving the efficiency and ultimately decarbonizing the transport sector. While…
The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
Elisabeth Gaar, Dunja Pucher
The stability number of a graph, defined as the cardinality of the largest set of pairwise non-adjacent vertices, is NP-hard to compute. The exact subgraph hierarchy (ESH) provides…
A Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring
Elisabeth Gaar, Franz Rendl
The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…