The knapsack problem: A survey

A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and x_i ? 0, integer; where v_i, w_i and W are known integers, and w_i (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi-dimensional case, are also considered.     

高场强电磁脉冲模拟器及其生物学研究

介绍了一种新建的适用于生物效应研究的高场强电磁脉冲(EMP)模拟器,描述了其工作原理、设计参数。调试结果表明,此模拟器达到了设计要求,且性能稳定。动物实验已初步表明,高场强EMP可致大鼠中枢神经系统血液循环障碍,神经细胞变性,突触结构模糊等改变。     

Due-date assignment and early/tardy scheduling on identical parallel machines

This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc.     

货郎担问题新算法

将指派问题的匈牙利解法用于货郎担问题,通过恰当地添加大正数构造效率矩阵,得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程,该算法具有一定的实用性。     

民族宗教分裂势力对国家安全的影响及对策

极端民族宗教分裂势力恐怖活动已严重危害我国领土主权完整、威胁社会政治稳定,对国家安全构成严重威胁,必须采取相应对策予以打击。     

The elephant in the room

When United States (US) President Barack Obama announced in 2013 that he would host the first United States-Africa leaders' summit the next year, he was greeted with considerable scepticism. Many critics thought he was just playing catch-up with other countries and organisations which had been holding Africa summits for years, especially China. But, whatever the motives, the event itself proved to be a substantial success, probably re-setting US relations with Africa for many years to come.     

Mirror,mirror on the wall,who is the most offensive of them all? – Explaining the offensive bias in military tactical thinking

This article explores why the offensive predominates military tactical thinking. With survey results showing an offensive bias among 60 per cent of senior Swedish officers and as many as 80 per cent in the case of the army, it is clear that this is not just a problem of the past but is equally relevant today. The article asks why there is a tendency to perceive and understand offensive tactics as the preferred choice and the way to conduct battle that should be encouraged and preferred. Drawing on existing research and the findings of a pilot study, ten propositions for why the offensive bias exists are tested using a mixed-method approach. Based on the findings, the article develops a model to understand why the offensive dominates military tactical thinking. It is found that the two key constitutive factors behind the offensive bias are military culture and education. These factors most directly and profoundly influence an officer’s identity, perceptions, and thinking. Military culture and education, in turn, work as a prism for four other factors: military history, the theory and principles of war, doctrine and TTPs, and psychological factors.     

On the solution of a stochastic bottleneck assignment problem and its variations

In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered.     

地方物流供应商“偷懒”行为监管机制研究

军民融合现代军事物流体系中,地方物流供应商往往会"偷懒",这必将损害军民融合现代军事物流体系的整体绩效。首先描述了"偷懒"行为及其危害性,从机制入手,基于博弈论建立地方物流供应商"偷懒"行为监管机制;分析并证明了监管机制的有效性。这一机制的构建对于监管地方物流供应商具有重要作用。