Budgetary trade-offs of security expenditures in Turkey

This paper investigates the budgetary trade-off structure of security (defence+internal security) expenditures in Turkey for the period 1983-1998. A modified version of Todaro's distributive share index of social welfare is used to quantify the impacts on the growth of primary budget expenditures of Security, Education, Health, General Administration, Infrastructure, and Social Services. We find that defence expenditures dominate overall security expenditures and are less affected in times of bottlenecks in the economy. A systematic pattern of negative budgetary trade-offs of security expenditures in terms of other components is not identified. We also analyse the expenditures of the Defence Industry Support Fund in an attempt to find the cost of the modernisation program to the economy.     

AN ECONOMIC ANALYSIS OF SECURITY POLICIES

This paper analyses public policy choices in the security economy from an economic perspective. It discusses the role of public goods for national and global security and identifies the importance of the first‐ and second‐order indirect effects of insecurity on economic activity, which include the behavioural responses of agents and the government to security measures, akin to such effects in insurance economics. Furthermore, key public policy trade‐offs are outlined, in particular between security and efficiency, globalisation, equity and freedom. The analysis identifies suitable policy options for raising security in the national and international contexts and in view of these trade‐offs. A balance between market and non‐market instruments in achieving security should be aimed for in order to minimise the adverse effects of aiming for higher security. In addition, the public good nature of security implies that international coordination of security policies is important, despite this process being fraught with enforcement problems.     

SYMBIOTIC SPIES

Spying on the Nuclear Bear: Anglo-American Intelligence and the Soviet Bomb, by Michael S. Goodman. Stanford University Press, 2007. 295 pages, $50.     

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     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005