全文获取类型
收费全文 | 376篇 |
免费 | 8篇 |
出版年
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 83篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2009年 | 9篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 14篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 13篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 3篇 |
排序方式: 共有384条查询结果,搜索用时 15 毫秒
301.
302.
Lawrence E. Cline 《Defense & Security Analysis》2019,35(3):241-260
Most counterinsurgency campaigns have featured the use of some form of local defense forces. Such forces have had a somewhat mixed record, both in their usefulness in actually countering insurgents and in their longer-term impact on internal security. This article focuses on historical cases that provide lessons for the best operational and strategic uses of local defense forces and measures to control their activities. 相似文献
303.
Stephen J. Cimbala 《Defense & Security Analysis》2016,32(2):115-128
The United States and Russia, in the aftermath of Russia’s annexation of Crimea and destabilization of Ukraine, seem to have ditched entirely the “reset” in their political relations. Despite this odor of Cold War redux, there remain the opportunities and necessities for renewed attention to strategic nuclear arms control as between the two governments. US and NATO missile defenses as planned for European deployment figure into this equation, although in somewhat unpredictable ways, given technological uncertainties in existing and foreseeable defenses, as well as the possibility of improved delivery systems for offensive conventional or nuclear weapons. 相似文献
304.
305.
306.
火灾预防和火灾扑救不仅仅是消防部门自身的职责,必须依靠社会综合力量,政府是处置各类突发事件的强势者。从北京沧达农工商公司草垛火灾谈起,对政府职责、单位消防安全责任、社会应急机制等存在的问题做了进一步阐述。 相似文献
307.
John E. Mitchell 《海军后勤学研究》2003,50(7):683-701
The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003. 相似文献
308.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
309.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
310.
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support 下载免费PDF全文
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献