全文获取类型
收费全文 | 255篇 |
免费 | 3篇 |
出版年
2021年 | 3篇 |
2019年 | 3篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 61篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 5篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 6篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1967年 | 2篇 |
1966年 | 2篇 |
1948年 | 3篇 |
排序方式: 共有258条查询结果,搜索用时 15 毫秒
91.
Thijs W. Brocades Zaalberg 《Small Wars & Insurgencies》2013,24(4):399-420
History teaches that counterinsurgency and counterterrorism campaigns have never been won through purely military action. Defeating an opponent who avoids open battle, but who uses force to reach his goals, including terrorist action, requires a combination of police, administrative, economic and military measures. As a counterinsurgency campaign should pursue a comprehensive political objective, it requires high levels of civil–military cooperation. However, current NATO doctrine for Civil–Military Cooperation (CIMIC) as it emerged from the 1990s is founded in conventional war-fighting and outdated peacekeeping doctrine. CIMIC's focus is on supporting military objectives rather than enabling the military to make a coherent contribution to political objectives. This makes CIMIC unfit for the Alliance's main operational challenges that have expanded from peace operations on the Balkans to countering insurgent terrorism in Afghanistan. When developing CIMIC, the Alliance obviously neglected the historical lessons from counterinsurgency campaigns. 相似文献
92.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
93.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
94.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
95.
96.
In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed. 相似文献
97.
Mary W. Cooper 《海军后勤学研究》1981,28(2):301-307
An algorithm is presented to gain postoptimality data about the family of nonlinear pure integer programming problems in which the objective function and constraints remain the same except for changes in the right-hand side of the constraints. It is possible to solve such families of problems simultaneously to give a global optimum for each problem in the family, with additional problems solved in under 2 CPU seconds. This represents a small fraction of the time necessary to solve each problem individually. 相似文献
98.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献
99.
The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically. 相似文献
100.
A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure. 相似文献