Antibiotics time machines are hard to build

DOI10.1090/NOTI1590MaRDI QIDQ4599236zbMATH OpenOpenAlexFDO

Authors Jed Yang, Ngoc Mai Tran

Publication date 18 December 2017

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/noti1590

zbMATH Keywords

NP-hardresistance to antibiotics

Mathematics Subject Classification ID

Medical applications (general) (92C50) Applications of mathematical programming (90C90) Population dynamics (general) (92D25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Rational design of antibiotic treatment plans: a treatment strategy for managing evolution and reversing resistance
• Economics of antibiotic resistance: A theory of optimal use
• A model of antibiotic resistance evolution dynamics through P systems with active membranes and communication rules
• Rotating antibiotics selects optimally against antibiotic resistance, in theory
• Combinatorial optimization in rapidly mutating drug-resistant viruses

Cited in

(3)

• Optimal Switching Sequence for Switched Linear Systems
• Optimization problems involving matrix multiplication with applications in materials science and biology
• A stochastic programming approach to the antibiotics time machine problem

This page was built for publication: Antibiotics time machines are hard to build

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