Suchergebnisse

"Aid and Ebb Tide: A History of CIDA and Canadian Development Assistance examines Canada's mixed record since 1950 in transferring over $50 billion in capital and expertise to developing countries through ODA. It focuses in particular on the Canadian International Development Agency (CIDA), the organization chiefly responsible for delivering Canada's development assistance. Aid and Ebb Tide calls for a renewed and reformed Canadian commitment to development cooperation at a time when the gap between the world's richest and poorest has been widening alarmingly and millions are still being born into poverty and human insecurity."--Jacket

AbstractThe cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017