A Local-branching Heuristic for the Best Subset Selection Problem in Linear Regression. - Tamara Bigler; Oliver Strub (IEEM, 2018)

Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. - Tamara Bigler; Philipp Baumann; Manuel Kammermann (IEEM, 2019)

A matheuristic for a customer assignment problem in direct marketing. - Tamara Bigler; Manuel Kammermann; Philipp Baumann (Eur. J. Oper. Res., 2023)

Workload-Balancing Constraints in a Continuous-Time Integer Programming Formulation for the Resource-Constrained Project Scheduling Problem. - N. Ackermann; Tamara Bigler; Norbert Trautmann (IEEM, 2024)

A matheuristic for locating obnoxious facilities. - Tamara Bigler (Comput. Oper. Res., 2024)

MIP-based solution approaches for multi-site resource-constrained project scheduling. - Tamara Bigler; Mario Gnägi; Norbert Trautmann (Ann. Oper. Res., 2024)