Dual‐ascent and primal heuristics for production‐assembly‐distribution system design

This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Sweden and the dilemmas of neutral intelligence liaison

Throughout the Cold War Sweden pursued a declared policy of non-alignment. Sweden nevertheless established security links with a number of Western powers, first of all Britain and the US. The most extensive links were developed in two areas – military technology and intelligence. Intelligence liaison was of crucial importance for the security of non-aligned Sweden, but also significant for the major Western powers in filling gaps in intelligence collection. But intelligence liaison also served as an instrument in a closed policy arena where Sweden could receive or pay back favours, according to a pattern established already during World War II. However, intelligence liaison contained policy dilemmas, some of a more general nature, some specific for a country with an overt policy of non-alignment.