Political influence on civil war mortality rates: The electoral college as a battlefield

This paper employs public choice analysis to explain certain kinds of military decision‐making during the Civil War. Specifically, the political costs and benefits which may have influenced policy with respect to casualty rates in the Union army are considered. A primary empirical finding is that electoral votes per capita are a strong explainer of casualties across Union states, all else equal.     

ALL TOGETHER NOW

Banning Weapons of Mass Destruction, by Frederick N. Mattis. Praeger Security International, 2009. 129 pages, $39.95.     

On the utility of security fences along international borders

States confronting cross-border intrusions of terrorism, illegal immigration, and/or drug trafficking weigh the costs of such intrusions against the costs of imposing barriers to prevent or curb the intrusions. In such situations, the degree of national security afforded a state depends, in large measure, upon the degree of border openness the state chooses. Depending upon the intensity and frequency of the intrusions – expressed in terms of opportunity-cost functions – a state might have little choice but to pursue a border policy of zero openness. It is this relationship of border openness to national security that explains why many states choose to construct security fences. In the 49 cases of security fences examined, many – among them Israel vis-à-vis the West Bank, India vis-à-vis Pakistan, Turkey vis-à-vis Greece in Cyprus – the construction of security fences becomes more complicated by their placement on lands whose sovereignties are disputed.     

CALLING FOR ACTION

International Atomic Energy Agency (IAEA) safeguards are under more stress today than at any time in their history. Compliance concerns, a shortage of resources and technology, and growing responsibilities threaten to undermine the effectiveness and credibility of this vital and fundamental pillar of the nonproliferation regime. To address this challenge, the United States recently launched the Next Generation Safeguards Initiative. The goal of this initiative is to ensure the IAEA makes the fullest possible use of its existing authority to prevent the diversion of safeguarded material and to investigate suspicious activities. The initiative will advance state-of-the-art technology, foster the development of a new generation of safeguards experts, and promote technology collaborations and safeguards-conscious infrastructure in states using or pursuing nuclear power. Although it has a domestic focus, the initiative's intent is to catalyze a much broader commitment to international safeguards in partnership with other governments and the IAEA.     

Securing a border under asymmetric information

We study a stochastic interdiction model of Morton et al. IIE Transactions, 39 (2007):3–14 that locates radiation sensors at border crossings to detect and prevent the smuggling of nuclear material. In this model, an interdictor places sensors at customs checkpoints to minimize a potential smuggler's maximum probability of crossing a border undetected. We focus on a model variant in which the interdictor has different, and likely more accurate, perceptions of the system's parameters than the smuggler does. We introduce a model that is tighter and uses fewer constraints than that of Morton et al. We also develop a class of valid inequalities along with a corresponding separation procedure that can be used within a cutting‐plane approach to reduce computational effort. Computational results demonstrate the effectiveness of our approach.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 91–100, 2014     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014