The daily swab test collection problem

DOI10.1007/S10479-022-05019-1MaRDI QIDQ6547116zbMATH OpenFDO

Authors Roberto Aringhieri, Sara Bigharaz, Alessandro Druetto, Davide Duma, Andrea Grosso, Alberto Guastalla

Publication date 30 May 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-022-05019-1

zbMATH Keywords

Covid-19digital contact tracinghybrid algorithmsOR in health servicesteam orienteering problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• A large neighbourhood search metaheuristic for the contagious disease testing problem
• Optimal test allocation
• A goal programming model for two-stage COVID19 test sampling centers location-allocation problem
• Optimizing specimen collection for processing in clinical testing laboratories
• Optimal collection of medical specimens and delivery to central laboratory

Cites work

• A fast and effective heuristic for the orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Emergency medical services and beyond: addressing new challenges through a wide literature review
• Estimating the Held-Karp lower bound for the geometric TSP
• Fairness in ambulance routing for post disaster management
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Hybrid constructive heuristics for the critical node problem
• Integer Programming Formulation of Traveling Salesman Problems
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Pyomo -- optimization modeling in Python
• The clustered team orienteering problem
• The multi-visit team orienteering problem with precedence constraints
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The team orienteering problem
• The vehicle routing problem with profits and consistency constraints

Cited in

(2)

• A large neighbourhood search metaheuristic for the contagious disease testing problem
• The team orienteering problem with service times and mandatory \& incompatible nodes

This page was built for publication: The daily swab test collection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547116)