排序方式: 共有26条查询结果,搜索用时 15 毫秒
1.
Michael J. Deane Lawrence James Edward M. Spiers Philip Gummett Brian Holden Reid 《Defense & Security Analysis》1989,5(3):275-284
Red Banner: the Soviet Military System in Peace and War. By Christopher Donnelly. Jane's Information Group, Coulsdon, UK (1988), 288 pp., £35.00
Images of T. E. Lawrence. By S. E. Tabachnick and C. Matheson. Jonathan Cape, London (1988); The Letters of T. E. Lawrence. Edited by Malcolm Brown. Dent, London (1988); T. E. Lawrence. By J. Wilson. National Portrait Gallery Publications, London (1988); Lawrence and the Arab Revolts. By D. Nicolle. Osprey, London (1989)
Liddell Hart and the Weight of History. By John Mearsheimer. Brassey's, London (1989), £15.95
Science and Mythology in the Making of Defence Policy. Edited by Margaret Blunden and Owen Greene. Brassey's, London (1989), £27.50/$44.00
Warfare in the Twentieth Century. Edited by Colin McInnes and G. D. Sheffield. Unwin Hyman, London (1988), 239 pp., £25.00 相似文献
Images of T. E. Lawrence. By S. E. Tabachnick and C. Matheson. Jonathan Cape, London (1988); The Letters of T. E. Lawrence. Edited by Malcolm Brown. Dent, London (1988); T. E. Lawrence. By J. Wilson. National Portrait Gallery Publications, London (1988); Lawrence and the Arab Revolts. By D. Nicolle. Osprey, London (1989)
Liddell Hart and the Weight of History. By John Mearsheimer. Brassey's, London (1989), £15.95
Science and Mythology in the Making of Defence Policy. Edited by Margaret Blunden and Owen Greene. Brassey's, London (1989), £27.50/$44.00
Warfare in the Twentieth Century. Edited by Colin McInnes and G. D. Sheffield. Unwin Hyman, London (1988), 239 pp., £25.00 相似文献
2.
Brian N. Hall 《战略研究杂志》2013,36(7):1001-1030
Information Management (IM) – the systematic ordering, processing and channelling of information within organisations – forms a critical component of modern military command and control systems. As a subject of scholarly enquiry, however, the history of military IM has been relatively poorly served. Employing new and under-utilised archival sources, this article takes the British Expeditionary Force (BEF) of the First World War as its case study and assesses the extent to which its IM system contributed to the emergence of the modern battlefield in 1918. It argues that the demands of fighting a modern war resulted in a general, but not universal, improvement in the BEF’s IM techniques, which in turn laid the groundwork, albeit in embryonic form, for the IM systems of modern armies. 相似文献
3.
4.
5.
Brian Balmer 《战略研究杂志》2013,36(4):115-145
6.
This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
7.
8.
Brian Holden Reid 《战略研究杂志》2013,36(4):131-138
James M. McPherson, For Cause and Comrades: Why Men Fought in the Civil War. New York: Oxford University Press, 1997. Pp.xv + 237, appendix, notes, index. £20 (cloth); $13.95 (paper). ISBN 0–10–512499–5 相似文献
9.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
10.
In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献