Child Soldiering in Colombia: Does Poverty Matter?

Child soldiering remains a challenge for the international community, and non-state armed groups are the most persistent offenders, but its drivers are poorly understood. Recent contributions suggest that decisions by armed groups are the key to explain child soldiering and that contextual variables are less relevant. This article exploits the availability of subnational, longitudinal data on child soldiering in Colombia, where insurgents and private militias have recruited children at least since the 1990s. The analysis shows that child recruitment is more likely in poorer municipalities, with limited access to education, and where coca crops are grown.     

高层建筑内装修阻燃技术研究

针对高层建筑的内装修阻燃问题,介绍了一些建材用阻燃剂及内装修各部位的阻燃处理方法。分析了我国装修阻燃现状,并对我国装修阻燃技术的发展趋势进行了探讨。     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.     

幼儿教师与在园幼儿法律关系之法理重塑

幼儿教师与在园幼儿的法律关系分别在教育学理论和法学理论上存在诸多争议.这些争议虽然有益,但大都难以自圆其说.文章主张将幼儿教师与在园幼儿法律关系定性为施惠型社会行政法律关系,并在此基础上从法理、法律体系、法律关系内涵等角度进行理论重塑.     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

An algorithm for the discrete bilevel programming problem

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting the leader's objective function into a parameterized constraint, and then attempt to solve the resultant problem. This produces a candidate solution that is used to find a point in the BLPP feasible reagion. Incremental improvements are sought, which ultimately lead to a global optimum. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. Computational experience indicates that the algorithm is capable of solving problems with up to 50 variables in a reasonable amount of time.     

TERRORISM AND DETERRENCE POLICY WITH TRANSNATIONAL SUPPORT 1

This study provides an explanation of terrorism by examining interactions between the terrorist group with a minority as a potential pool of recruits and the government supported by a majority. A hawkish deterrence policy makes it more risky for terrorists to launch attacks, but heightens the anti‐government feeling of the terrorist group. In addition, the payoff for the government depends not only on the payoff loss associated with the level of terrorism, but also on the political payoff from the action itself of adopting a hawk policy due to its politicians’ vested interests. We first show that whether the deterrence policy should be ‘hawk to ‘dove is closely dependent on the relationships among the risk associated with terrorism, the anti‐government feeling of the terrorist group, and the political payoff for the government. This study then introduces transnational support enhancing the capability of a terrorist group to intensify its activity and shows that the emergence of transnational support may cause the government to reform its deterrence policy from ‘dove’ toward ‘hawk,’ with terrorism intensified in the society.     

Minimizing Public Sector Corruption: The Economics of Crime,Identity Economics,and Money Laundering

Abstract

This paper offers a simple strategic framework to help governments identify various policy mechanisms to minimize public sector corruption. The paper offers a formal model that blends the economics of crime with identity economics and money laundering. It presents a partial equilibrium framework that focuses on a representative public official engaged in a mix of legal and illegal effort. The model introduces various levers a government might use to impact the costs and benefits of illegal effort. The ultimate goal is to help turn volatile vicious cycles of political instability, into steady virtuous cycles of stability, growth, and sustainable development.