全文获取类型
收费全文 | 292篇 |
免费 | 9篇 |
出版年
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 10篇 |
2016年 | 8篇 |
2015年 | 8篇 |
2014年 | 6篇 |
2013年 | 78篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 9篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 2篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 2篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
51.
Cumulative search-evasion games (CSEGs) are two-person zero-sum search-evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T-time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown-Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures. 相似文献
52.
James Igoe Walsh 《战略研究杂志》2018,41(1-2):143-159
Targeted killings have become a central tactic in the United States' campaigns against militant and terrorist groups in the Middle East, Asia, and Africa. Both ‘demand’ and ‘supply’ factors explain the rise of targeted killings. Demand for targeted killings increased as the United States faced new threats from militant groups that could not be effectively countered with conventional military force. Concerns about the political consequences of long-term military involvement overseas and American casualties led political leaders to supply more targeted killings. The conclusion discusses how this tactic may have unintended consequences as other states follow the United States use of targeted killings. 相似文献
53.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
54.
55.
56.
James G. Taylor 《海军后勤学研究》1973,20(4):673-697
We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process. 相似文献
57.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
58.
59.
In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
60.
James R. Evans 《海军后勤学研究》1978,25(1):31-37
The simplex method is interpreted as a labeling procedure for certain classes of multicommodity flow problems in a manner similar to that for single commodity networks. As opposed to general multicommodity algorithms, no explicit matrix inversion is required; all simplex operations are performed graph-theoretically. 相似文献