Decomposition algorithms for the maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998     

Algorithms for the constrained maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc.     

State fragility and violent uprisings in Nigeria

Abstract

The emergence of the Islamic sect, Boko Haram, and its transformation into a terrorist organisation has dominated recent discourse in the fields of political science and security studies, both within and without the socio-politico enclave known as Nigeria. Much of the discussion has centred on the extra-judicial execution of its founder, Mohammed Yusuf, which purportedly intensified the radicalisation of the group, and whether or not the sect receives operational and/or financial support from foreign terrorist associations. The interest of others has been to forecast the possibility of the internationalisation of the group's activities. This paper aligns with those whose interest is to identify and proffer ways of resolving factors that predisposed the Nigerian state to the levels of violence perpetrated by Boko Haram, with a view to averting much greater crises in the future. It adopts some historicism in demonstrating that the responsibility for the deepening insecurity in the country resides in the Nigerian state structure, which has often been seen as willing to sacrifice the well-being of the many for the benefit of a few. On the whole, the paper utilises state fragility as the framework of analysis by identifying the incapacity of the state in effective service delivery, which has as a result created a situation of mass unemployment and extreme poverty that has fanned the Boko Haram uprising. It concludes that a sustainable solution to the crisis lies in addressing the root causes of inequality, unemployment and poverty, with which most Nigerians, particularly in the north, subsist.     

Economic Performance And Terrorist Activity In Latin America

We investigate the link between economic performance and terrorism for 18 Latin American countries from 1970 to 2007, taking into account the potentially complex nature of this link. Panel causality analysis findings indicate that during this period, terrorism had no causal effect on economic growth. By contrast, we find that growth reduced terrorism in the less developed but not in the higher developed Latin American economies. We argue that group-specific differences (linked to patterns of economic development) govern this causal heterogeneity. From a series of negative binomial regressions we gain additional support for our findings, while also identifying further determinants of terrorism.     

Optimal disposal policies for a single-item inventory system with returns

We consider a single-item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy. It is shown that this problem is equivalent to a problem of controlling a single-server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given. An interesting by-product of our investigation is an approximation for the steady-state behavior of the bulk GI/G/1 queue with a queue limit.     

Due‐window assignment with unit processing‐time jobs

In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

In Defense of Mercy

ABSTRACT

Though it is legally permissible to kill combatants in war, unless they are rendered hors de combat, the existence of “Naked Soldiers” raises an important moral question: should combatants kill vulnerable enemy combatants or show mercy towards them? Most philosophers who address this question argue that it is morally permissible to kill the Naked Soldier given the extended notion of self-defense during war. They ground their arguments in a form of collectivism. In this article, I use Larry May’s argument. He offers an approach that extends the principle of discrimination that would apply also to combatants. Instead of assuming all combatants are de facto dangerous, this approach would allow for nuance in targeting the enemy and showing mercy when enemy combatants clearly pose no danger, in other words, when they are Naked Soldiers. I defend this view against two criticisms: Noam Zohar’s view of armies as complex collectives and Stephen Deakin’s view that a policy that spares Naked Soldiers would be open to abuse. I argue that it is not only morally suspect to kill Naked Soldiers, but also it is within the spirit of both international laws governing war and the just war tradition to offer mercy whenever possible.