The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc.     

Varieties of Assurance

Strategies that seek to assure other states about their security have the potential to reduce international conflict and dissuade states from seeking nuclear weapons. Yet, relative to other tools of statecraft such as deterrence, assurance remains understudied. To facilitate further empirical research on assurance strategies, this article identifies variations in the terminology scholars and policymakers have used to refer to such strategies and describes the concept of assurance associated with each variant. It seeks to clarify and standardize usage and show that there is a general, overarching concept of assurance that links the different variants. It also summarizes existing bodies of empirical research that are relevant to assessing the utility of different forms of assurance.     

IED casualties mask the real problem: it's us

Casualty figures suggest that the US/Allied Counter Improvised Explosive Device (C-IED) policy and the present allocation of national assets, resources, and intellectual capital have not been very successful. A number of explanations for why this has been the case are discussed and critiqued here.     

Tree-search algorithms for quadratic assignment problems

Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or indusatrial engineer in laying out activities, offices, or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility; and so on. In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and dcscribing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal.