David Wolfinger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
David Wolfinger has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Karl F. Doerner
Department of Business Decisions and Analytics, University of Vienna, Vienna, Austria
2 shared publications - Margaretha Gansterer
Department of Operations, Energy, and Environmental Management, University of Klagenfurt, Klagenfurt, Austria
2 shared publications - Fabien Tricoire
Institute for Transport and Logistics Management, Vienna University of Economics and Business, Vienna, Austria
1 shared publication Juan-José Salazar-González
1 shared publicationKarl F. Doerner
University of Vienna
1 shared publication- Niki Popper
Vienna University of Technology, Austriaand dwh GmbH
1 shared publication
Latest Publications
- Open Access
- 9 September 2025
- Published by Emerald Publishing in Logistics Research
- Vol. 18 (1-2) , 135-160
Solving the stochastic dynamic contagious disease testing problem
Purpose: In early 2020, the coronavirus disease 2019 (COVID-19) pandemic reached global proportions within only a few weeks. A key strategy to contain and control pandemics is to isolate infected people, which requires making test results available quickly, in order to be effective. The contagious disease testing problem (CDTP) arises precisely in this context of testing potential cases (of infection). In this paper, we address the stochastic and dynamic version of the CDTP, where only some suspected cases are known in advance, while others arrive randomly throughout the course of the day. For each newly arriving suspected case, it must be decided whether to accept or reject it. The specimens of accepted suspected cases must be collected on the same day; either by assigning the case to a time slot in a test-center or by visiting the patient with a mobile test-team. Rejected suspected cases must be serviced on the next day. The task in this problem is to decide how many mobile test-teams to use, how many test-centers to open and where, which suspected cases to visit with a mobile test-team and which to assign to a test-center, and designing the vehicle routes for the mobile test-teams. The objective is to identify a dynamic assignment-and-routing policy that minimizes the number of open test-centers and used vehicles, services all early-known suspected cases, and maximizes the expected number of serviced late-known suspected cases. Design/methodology/approach: We introduce this new problem, which we call the stochastic dynamic contagious disease testing problem (SDCDTP), and formulate it as a Markov decision process. We propose a solution method based on value function approximation for solving the SDCDTP, and illustrate its performance with an extensive computational study. Findings: We solve and analyze real-world-based problem instances from which we draw insights regarding the solution quality produced by our approach. Originality/value: We find that a (significant) increase in the number of covered late-known suspected cases can be achieved by not minimizing the number of used vehicles and test-centers, albeit for the price of equally significant increases in the amount of used infrastructure.
- 9 September 2025
- Published by Emerald Publishing in Logistics Research
- Vol. 18 (1-2) , 135-160
Open AccessSolving the stochastic dynamic contagious disease testing problem
Purpose: In early 2020, the coronavirus disease 2019 (COVID-19) pandemic reached global proportions within only a few weeks. A key strategy to contain and control pandemics is to isolate infected people, which requires making test results available quickly, in order to be effective. The contagious disease testing problem (CDTP) arises precisely in this context of testing potential cases (of infection). In this paper, we address the stochastic and dynamic version of the CDTP, where only some suspected cases are known in advance, while others arrive randomly throughout the course of the day. For each newly arriving suspected case, it must be decided whether to accept or reject it. The specimens of accepted suspected cases must be collected on the same day; either by assigning the case to a time slot in a test-center or by visiting the patient with a mobile test-team. Rejected suspected cases must be serviced on the next day. The task in this problem is to decide how many mobile test-teams to use, how many test-centers to open and where, which suspected cases to visit with a mobile test-team and which to assign to a test-center, and designing the vehicle routes for the mobile test-teams. The objective is to identify a dynamic assignment-and-routing policy that minimizes the number of open test-centers and used vehicles, services all early-known suspected cases, and maximizes the expected number of serviced late-known suspected cases. Design/methodology/approach: We introduce this new problem, which we call the stochastic dynamic contagious disease testing problem (SDCDTP), and formulate it as a Markov decision process. We propose a solution method based on value function approximation for solving the SDCDTP, and illustrate its performance with an extensive computational study. Findings: We solve and analyze real-world-based problem instances from which we draw insights regarding the solution quality produced by our approach. Originality/value: We find that a (significant) increase in the number of covered late-known suspected cases can be achieved by not minimizing the number of used vehicles and test-centers, albeit for the price of equally significant increases in the amount of used infrastructure.
- Open Access
- 21 October 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 304 (1) , 169-182
A Large Neighbourhood Search Metaheuristic for the Contagious Disease Testing Problem
- 21 October 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 304 (1) , 169-182
Open AccessA Large Neighbourhood Search Metaheuristic for the Contagious Disease Testing Problem
- Open Access
- 1 March 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (2) , 470-484
The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
- 1 March 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (2) , 470-484
Open AccessThe Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
- Open Access
- 1 February 2021
- Published by Elsevier in Computers & Operations Research
- Vol. 126
A Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
- 1 February 2021
- Published by Elsevier in Computers & Operations Research
- Vol. 126
Open AccessA Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
- Open Access
- 22 August 2018
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 8 (4) , 397-433
A matheuristic for a multimodal long haul routing problem
- 22 August 2018
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 8 (4) , 397-433
Open AccessA matheuristic for a multimodal long haul routing problem