Catastrophe Risk Models for Evaluating Disaster Risk Reduction Investments in Developing Countries

Major natural disasters in recent years have had high human and economic costs, and triggered record high postdisaster relief from governments and international donors. Given the current economic situation worldwide, selecting the most effective disaster risk reduction (DRR) measures is critical. This is especially the case for low‐ and middle‐income countries, which have suffered disproportionally more economic and human losses from disasters. This article discusses a methodology that makes use of advanced probabilistic catastrophe models to estimate benefits of DRR measures. We apply such newly developed models to generate estimates for hurricane risk on residential structures on the island of St. Lucia, and earthquake risk on residential structures in Istanbul, Turkey, as two illustrative case studies. The costs and economic benefits for selected risk reduction measures are estimated taking account of hazard, exposure, and vulnerability. We conclude by emphasizing the advantages and challenges of catastrophe model‐based cost‐benefit analyses for DRR in developing countries.     

Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem

In a previous work we proposed a variable fixing heuristics for the 0-1 Multidimensional knapsack problem (01MDK). This approach uses fractional optima calculated in hyperplanes which contain the binary optimum. This algorithm obtained best lower bounds on the OR-Library benchmarks. Although it is very attractive in terms of results, this method does not prove the optimality of the solutions found and may fix variables to a non-optimal value. In this paper, we propose an implicit enumeration based on a reduced costs analysis which tends to fix non-basic variables to their exact values. The combination of two specific constraint propagations based on reduced costs and an efficient enumeration framework enable us to fix variables on the one hand and to prune significantly the search tree on the other hand. Experimentally, our work provides two main contributions: (1) we obtain several new optimal solutions on hard instances of the OR-Library and (2) we reduce the bounds of the number of items at the optimum on several harder instances.