首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   41篇
  免费   2篇
  2021年   1篇
  2019年   1篇
  2017年   1篇
  2016年   2篇
  2015年   5篇
  2014年   1篇
  2013年   19篇
  2012年   2篇
  2007年   1篇
  2004年   1篇
  2003年   1篇
  2002年   1篇
  1998年   1篇
  1995年   1篇
  1994年   1篇
  1991年   1篇
  1986年   1篇
  1985年   1篇
  1973年   1篇
排序方式: 共有43条查询结果,搜索用时 46 毫秒
41.
India and Pakistan are currently engaged in a competition for escalation dominance. While New Delhi is preparing for a limited conventional campaign against Pakistan, Islamabad is pursuing limited nuclear options to deter India. Together, these trends could increase the likelihood of nuclear conflict. India, for example, might conclude that it can launch an invasion without provoking a nuclear reprisal, while Pakistan might believe that it can employ nuclear weapons without triggering a nuclear exchange. Even if war can be avoided, these trends could eventually compel India to develop its own limited nuclear options in an effort to enhance deterrence and gain coercive leverage over Pakistan.  相似文献   
42.
43.
Maintenance scheduling for modular systems: Modeling and algorithms   总被引:1,自引:0,他引:1       下载免费PDF全文
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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