 | Up a level |
Bigler, Tamara (2022). A matheuristic for the obnoxious p-median problem (Unpublished). In: 32nd European Conference on Operational Research. Espoo. 3.-6. July 2022.
Bigler, Tamara (2022). A binary-linear programming-based matheuristic for the obnoxious p-median problem (Unpublished). In: INFORMS Annual Meeting. Indianapolis. 16.- 19. October 2022.
Bigler, Tamara (2021). A matheuristic approach for the multi-site resource-constrained project scheduling problem (Unpublished). In: 31st European Conference on Operational Research. Athens. 11.- 14. July 2021.
Bigler, Tamara (2019). A binary linear programming model for assigning customers to direct marketing activities of a telecommunications provider (Unpublished). In: Manufacturing and Service Operations Management. Singapore. 30. June - 02. July 2019.
Bigler, T; Kammermann, M; Baumann, P (2023). A matheuristic for a customer assignment problem in direct marketing. European journal of operational research, 304(2), pp. 689-708. Elsevier 10.1016/j.ejor.2022.04.009
Bigler, Tamara; Gnägi, Mario; Trautmann, Norbert (2021). A novel matheuristic for the multi-site resource-constrained project scheduling problem. In: 17th International Workshop on Project Management and Scheduling.
Bigler, Tamara; Baumann, Philipp; Kammermann, Manuel (16 December 2019). Optimizing Customer Assignments to Direct Marketing Activities: A Binary Linear Programming Formulation. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). Macau. 15.-18.12.2019.
Bigler, Tamara; Strub, Oliver (17 December 2018). A Local-branching heuristic for the best subset selection problem in linear regression. In: IEEM 2018: IEEE International Conference on Industrial Engineering and Engineering Management. Bangkok. 16.-19.12.2018.
