Greedy Algorithms in Economic Epidemiology

Economic issues are central to the control of disease because of the limited funds available for public health everywhere in the world, even in the wealthiest nations. These economic issues are closely related to issues of individual human behavior, as well as to fundamental disease processes and their relation to the environment. While mathematical formulation of epidemiological processes is an old discipline, combining such formulations with economic, behavioral, and environmental formalisms is relatively new, and has come to define the field of “Economic Epidemiology.” Many problems in Economic Epidemiology can be formulated as optimization problems. The simplest approach to solving such a problem is often a greedy algorithm, one that always chooses the best available (cheapest, highest rated, ...) alternative at each step. We review some classical operations research problems arising in Economic Epidemiology for which the greedy algorithm in fact gives an optimal solution, and others for which it can be guaranteed to be reasonably close. We then present two examples from our own work. Examples will be chosen from: assigning workers to health care tasks; choosing medical supplies to maximize value and minimize cost; locating a health care facility so as to minimize the travel times of users; and reopening flooded roads to allow the passage of emergency vehicles. Other examples will include optimal strategies for vaccination given a limited supply; and optimal strategies for sequencing medical tests or public health interventions in order to minimize costs and

[1]  J. Kadane Quiz show problems , 1969 .

[2]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[3]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[4]  Fred S. Roberts,et al.  Meaningfulness of conclusions from combinatorial optimization , 1990, Discret. Appl. Math..

[5]  Fred S. Roberts,et al.  Efficient sequential decision‐making algorithms for container inspection operations , 2011 .

[6]  Fred S. Roberts,et al.  Applied Combinatorics , 1984 .

[7]  Christopher Rose,et al.  Highly mobile users and paging: optimal polling strategies , 1998 .

[8]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[9]  H. Chipman,et al.  Bayesian CART Model Search , 1998 .

[10]  Fred S. Roberts,et al.  Sequential Decision Making Algorithms for Port of Entry Inspection: Overcoming Computational Challenges , 2007, 2007 IEEE Intelligence and Security Informatics.

[11]  Susan H. Xu,et al.  Greedy algorithm for the general multidimensional knapsack problem , 2007, Ann. Oper. Res..

[12]  Steve Y. Chiu,et al.  Least-cost failure diagnosis in uncertain reliability systems , 1996 .

[13]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[14]  Gabriele Soffritti,et al.  The comparison between classification trees through proximity measures , 2004, Comput. Stat. Data Anal..

[15]  T. C. Hu,et al.  Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems , 1976, Oper. Res..

[16]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[17]  Fred S. Roberts,et al.  Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures , 2006, ISI.

[18]  Daniele Mundici Functions Computed by Monotone Boolean Formulas with no Repeated Variables , 1989, Theor. Comput. Sci..

[19]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[20]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[21]  Leslie E. Trotter,et al.  When the Greedy Solution Solves a Class of Knapsack Problems , 1975, Oper. Res..

[22]  Steffen L. Lauritzen,et al.  Representing and Solving Decision Problems with Limited Information , 2001, Manag. Sci..

[23]  Phillip D. Stroud,et al.  Enumeration of Increasing Boolean Expressions and Alternative Digraph Implementations for Diagnostic Applications , 2003 .

[24]  David E. Smith Controlling Backward Inference , 1989, Artif. Intell..

[25]  Fred S. Roberts,et al.  Chapter 18 Limitations on conclusions using scales of measurement , 1994, Operations research and the public sector.

[26]  Louis Anthony Cox,et al.  Optimal inspection and repair of renewable coherent systems with independent components and constant failure rates , 1994 .

[27]  M. R. Garey Simple Binary Identification Problems , 1972, IEEE Transactions on Computers.

[28]  Jaroslaw Byrka,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

[29]  K. L. Ng,et al.  A generalization of the firefighter problem on Z×Z , 2008, Discret. Appl. Math..

[30]  Endre Boros,et al.  Diagnosing double regular systems , 1999, Annals of Mathematics and Artificial Intelligence.

[31]  Paul B. Kantor,et al.  Optimization Problems for Port-of-Entry Detection Systems , 2008, Intelligence and Security Informatics.

[32]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.

[33]  Fred S. Roberts,et al.  GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION , 2004 .

[34]  A. Young,et al.  The past and future roles of epidemiology and economics in the control of tick-borne diseases of livestock in Africa: The case of theileriosis , 1995 .

[35]  M. R. Garey,et al.  Optimal task sequencing with precedence constraints , 1973, Discrete Mathematics.

[36]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[37]  James R. Slagle,et al.  An Admissible and Optimal Algorithm for Searching AND/OR Graphs , 1971, Artif. Intell..

[38]  Edward I. George,et al.  Extracting Representative Tree Models From a Forest , 1998 .

[39]  J. Kynčl,et al.  Irreversible 2-conversion set is NP-complete , 2009 .

[40]  Melvin A. Breuer,et al.  An optimum testing algorithm for some symmetric coherent systems , 1984 .

[41]  G. Dantzig Discrete-Variable Extremum Problems , 1957 .

[42]  David Pisinger,et al.  Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[43]  Clyde L. Monma,et al.  Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions , 1987, Math. Oper. Res..

[44]  Herbert A. Simon,et al.  Optimal Problem-Solving Search: All-Oor-None Solutions , 1975, Artif. Intell..

[45]  V. Gurvich,et al.  On complexity of algorithms for modeling disease transmission and optimal vaccination strategy , 2007 .

[46]  Yosi Ben-Dov Optimal Testing Procedures for Special Structures of Coherent Systems , 1981 .

[47]  Dan Geiger,et al.  Optimal Satisficing Tree Searches , 1991, AAAI.

[48]  R. A. Johnson,et al.  Diagnosis of Equipment Failures , 1960 .

[49]  Marcus W Feldman,et al.  Coevolution of pathogens and cultural practices: a new look at behavioral heterogeneity in epidemics. , 2002, Theoretical population biology.

[50]  F. Roberts Measurement Theory with Applications to Decisionmaking, Utility, and the Social Sciences: Measurement Theory , 1984 .

[51]  D. Earn,et al.  Vaccination and the theory of games. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[52]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[53]  Richard Butterworth Some Reliability Fault-Testing Models , 1972, Oper. Res..

[54]  E. Boros,et al.  Sequential Testing of Series-Parallel Systems of Small Depth , 2000 .

[55]  Fred S. Roberts,et al.  Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..

[56]  A. Raouf,et al.  An optimal sequence in multicharacteristics inspection , 1990 .

[57]  C. Bauch Imitation dynamics predict vaccinating behaviour , 2005, Proceedings of the Royal Society B: Biological Sciences.

[58]  Scott Barrett,et al.  Eradication versus control: the economics of global infectious disease policies. , 2004, Bulletin of the World Health Organization.

[59]  Jinchang Wang,et al.  Question-asking strategies for Horn clause systems , 2005, Annals of Mathematics and Artificial Intelligence.

[60]  Jonathan Halpern Technical Note - Fault Testing for a k-out-of-n System , 1974, Oper. Res..

[61]  Lewis T. Reinwald,et al.  Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time , 1966, JACM.

[62]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.