首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   302篇
  免费   0篇
  302篇
  2021年   6篇
  2019年   10篇
  2018年   6篇
  2017年   10篇
  2016年   7篇
  2014年   6篇
  2013年   44篇
  2011年   3篇
  2010年   5篇
  2009年   5篇
  2008年   3篇
  2006年   5篇
  2005年   4篇
  2004年   6篇
  2003年   3篇
  2002年   10篇
  2001年   4篇
  2000年   4篇
  1999年   2篇
  1998年   4篇
  1997年   5篇
  1996年   2篇
  1995年   2篇
  1994年   3篇
  1993年   11篇
  1992年   4篇
  1991年   6篇
  1989年   4篇
  1988年   13篇
  1987年   3篇
  1986年   6篇
  1985年   11篇
  1984年   8篇
  1983年   4篇
  1982年   2篇
  1981年   2篇
  1980年   7篇
  1979年   4篇
  1978年   4篇
  1977年   6篇
  1976年   3篇
  1975年   2篇
  1974年   8篇
  1973年   3篇
  1972年   2篇
  1971年   10篇
  1970年   3篇
  1969年   5篇
  1968年   2篇
  1967年   2篇
排序方式: 共有302条查询结果,搜索用时 0 毫秒
161.
A new piece of equipment has been purchased in a lot of size m. Some of the items can be used in destructive testing before the item is put into use. Testing uncovers faults which can be removed from the remaining pieces of equipment in the lot. If t < m pieces of equipment are tested, then those that remain, m1 = mt, have reduced fault incidence and are more reliable than initially, but m1 may be too small to be useful, or than is desirable. In this paper models are studied to address this question: given the lot size m, how to optimize by choice of t the effectiveness of the pieces of equipment remaining after the test. The models used are simplistic and illustrative; they can be straightforwardly improved. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 623–637, 1997  相似文献   
162.
163.
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code.  相似文献   
164.
    
Much of the literature on the decolonization of Namibia is set in a narrative mode and demonizes one or the other of the protagonists. This article, organized in a topical fashion, concerns the diplomatic, military, and economic facets of the Namibian war and draws upon the literature of comparable twentieth century colonial and anti-colonial wars in Algeria, Angola, Kenya, Mozambique, the Philippines, South Africa, Vietnam and Zimbabwe. It explores the changing discourse of legitimacy concerning independence for Namibia, the conduct of insurgency and counterinsurgency in the bush war, and economic aspects of that war.  相似文献   
165.
    
The lessons from the two French counterinsurgencies, Indochina and Algeria, give rise to a new understanding of the projection of airpower in remote and hostile environments and the purpose, design, and use of aircraft in counterinsurgency. In both Indochina and Algeria, the campaigns were ones of poverty, and it is their imaginative management under severe resource constraints that provides thoughtful and applicable lessons for today. In both cases, airpower held the promise of delivering victory and solving the resource issue. In Indochina, acquisition of the needed aircraft, operating knowledge, and experience came too slowly to realize this promise. In Algeria, the French embraced the lessons from Indochina and were quite successful and innovative in the use of airpower. The lessons can be reduced to four requirements: (1) a network of airfields for liaison, ground-support, and intra-theater airlift to enable effective air support of ground forces; (2) a solid, reliable, and simple ground-support aircraft capable of operating from forward airfields within range of ground engagements; (3) a capable intra-theater heavy-lift transport to supply the extended ground forces; and (4) helicopter capability to enhance tactical troop mobility and support.  相似文献   
166.
    
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014  相似文献   
167.
168.
    
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
169.
The military effectiveness literature has largely dismissed the role of material preponderance in favor of strategic interaction theories. The study of counterinsurgency, in which incumbent victory is increasingly rare despite material superiority, has also turned to other strategic dynamics explanations like force employment, leadership, and insurgent/adversary attributes. Challenging these two trends, this paper contends that even in cases of counterinsurgency, material preponderance remains an essential—and at times the most important—factor in explaining battlefield outcomes and effectiveness. To test this, the paper turns to the case of the Sri Lankan state’s fight against the Tamil Tiger insurgency, a conflict which offers rich variation over time across six periods and over 25 years. Drawing on evidence from historical and journalistic accounts, interviews, memoirs, and field research, the paper demonstrates that material preponderance accounts for variation in military effectiveness and campaign outcomes (including military victory in the final campaign) better than strategic explanations. Additionally, a new quantitative data-set assembled on annual loss-exchange ratios demonstrates the superiority of materialist explanations above those of skill, human capital, and regime type.  相似文献   
170.
    
Technologically advanced aircraft rely on robust and responsive logistics systems to ensure a high state of operational readiness. This paper fills a critical gap in the literature for combat models by closely relating effectiveness of the logistics system to determinants of success in combat. We present a stochastic diffusion model of an aerial battle between Blue and Red forces. The number of aircraft of Blue forces aloft and ready to be aloft on combat missions is limited by the maximum number of assigned aircraft, the reliability of aircraft subsystems, and the logistic system's ability to repair and replenish those subsystems. Our parsimonious model can illustrate important trade‐offs between logistics decision variables and operational success.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号