SUICIDE TERRORISM AND THE BACKLASH EFFECT

This paper presents a game‐theoretic model of suicide terrorism containing three agents: the terrorist leader; a targeted government; and potential terrorist supporters. Supporters join the terrorist group if they gain more from their participation than from their economic opportunities. Preemptive measures by the government can result in a backlash that encourages recruitment through new grievances. Suicide attacks can also lead to recruitment. Increases in preemption costs and/or economic opportunities can reduce the overall level of terrorism, while increasing the proportion of suicide to normal attacks. An increase in the effect of preemption on recruitment, or the propaganda effect of suicide bombings has the opposite effect of increasing normal and suicide attacks, but decreasing the proportion of suicide to normal attacks in the terrorist organization’s strategy profile.     

Preserving defense technologies: A strategy for economic conversion†

This paper presents a model for converting legacy defense production facilities into private‐sector economic resources. Specifically, this paper will examine as a case study the first successful conversion of a former U.S. Department of Energy nuclear weapons production installation, including reasons for its success, its costs and benefits, and lessons for public policy. It is envisioned that this model may be useful for mitigating local economic hardship resulting from defense “downsizing” and for privatizing production capacities critical for national defense.     

The “yellow rain” controversy: Lessons for arms control compliance

Indonesia, Thailand, and Vietnam recently announced that they are launching nuclear energy programs, and Malaysia and the Philippines soon may follow suit. As a result, by 2020, at least three states in Southeast Asia could possess latent nuclear capabilities—the option to pursue military applications of dual-use nuclear technology. Analysis of the nuclear programs, domestic proliferation pressures, and the external threat environment in Southeast Asia leads the authors to conclude that the nuclear intentions of states in that region are entirely peaceful and the probability of future nuclear breakout there is low. However, this finding does not justify complacency. In the long term, the benign outlook for regional security may change, and in the near term weak regulatory regimes present serious challenges to nuclear safety and create opportunities that non-state actors may exploit. To minimize these risks, the authors recommend creating a “proliferation firewall” around the region, which would combine strong global support for Southeast Asian nuclear energy programs with innovative regional multilateral nuclear arrangements.     

The Telefunken Affairand the internationalisation of the Algerian War, 1957–59

Between 1957 and 1959 the West German company Telefunken and the Bonn government became prime targets in the French army's campaign against the Front de Libération Nationale's (FLN) efforts to establish communications networks. To the French military, the prevention of sales of Telefunken equipment to the FLN or its allies constituted a matter of strategic importance. To the Germans, it was an act of economic protectionism that exposed France's continued misgivings of Germany. The problem exerted a considerable strain between Paris and Bonn, and even threatened to harm German-Arab relations. The Telefunken affair thus highlights the Algerian war's international ramifications. It further reveals the responsibility of the French military in the internationalisation of that war.     

Local defence forces and counterinsurgency in Afghanistan: learning from the CIA's Village Defense Program in South Vietnam

Some scholars would have us believe that the distinctions between military and policing roles, methods and objectives have become increasingly blurred by the security demands of a post-Cold War and post-11 September global and domestic order. This article explores the current state of the police–military divide through a conceptual and case study analysis. It concludes that, in this case, there is some conflation occurring at a macro-level as international and domestic affairs have become increasingly indistinct, but the article also demonstrates that the actual ethos and practice of these agencies still differs strongly. Most importantly, the article argues that this distinction is in fact a very useful one in planning for future peace support operations     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Optimizing submarine berthing with a persistence incentive

Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997.