全文获取类型
收费全文 | 143篇 |
免费 | 2篇 |
出版年
2020年 | 1篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 61篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2004年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有145条查询结果,搜索用时 15 毫秒
101.
This study examines the failures of the William J. Clinton and Barack Obama administrations to secure ratification of the Comprehensive Nuclear-Test-Ban Treaty (CTBT). It applies an integrated analytical framework for assessing treaty ratification that builds upon previous research in order to understand why the Clinton administration failed to achieve CTBT ratification in 1999 and why the Obama administration has so far failed to advance the treaty in the Senate. The study concludes that CTBT ratification, despite Obama administration pledges of support, remains highly unlikely. Finally, the study analyzes the common domestic political factors present in both cases and suggests areas for further research. 相似文献
102.
Capability-based planning (CBP) is considered by many defence organisations to be the best practice for enterprise-level planning, analysis and management. This approach, loosely based around investment portfolio theory, is premised on balancing the cost, benefit and risk of capability options across the defence enterprise. However a number of authors have recently noted limitations of its current applications. The authors propose a more general, insurance-based approach, which can support the evolutionary improvement of the current CBP approach. This approach is implemented as hedging-based planning and aims to better reflect the enterprise nature of defence organisations, capturing both force structure and force generation aspects of military systems. 相似文献
103.
Cyberspace has emerged as a potentially new (and unconventional) domain for warfare. Much debate has focused on understanding cyber conflict. The ability to critically analyse this phenomenon is important; however, the nascent nature of cyberwarfare and the complexity of the systems involved create challenges not met by conventional approaches. As a first step, this requires an analytical construct to frame discussions in a way that highlights distinct characteristics of the cyber domain. An approach proposed is one of the postulating conjectures for debate as a way to achieve this and to demonstrate its use, both at the strategic and operational levels. It is suggested that such an approach provides one component of a mature analytical framework for the analysis of cyber across a range of warfare domains. 相似文献
104.
In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
105.
106.
Peter Kubat 《海军后勤学研究》1982,29(3):399-402
Let Xi be independent IFR random variables and let Yi be independent exponential random variables such that E[Xi]=E[Yi] for all i=1, 2, ? n. Then it is well known that E[min (Xi)] ≥E[min (Xi)]. Nevertheless, for 1≤i≤n exponentially distributed Xi's and for a decreasing convex function ?(.). it is shown that . 相似文献
107.
108.
109.
An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided. 相似文献
110.