全文获取类型
收费全文 | 666篇 |
免费 | 20篇 |
出版年
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 9篇 |
2015年 | 12篇 |
2014年 | 10篇 |
2013年 | 112篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2004年 | 11篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 12篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 17篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 12篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 9篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 13篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 12篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 9篇 |
1966年 | 8篇 |
排序方式: 共有686条查询结果,搜索用时 0 毫秒
31.
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided. 相似文献
32.
33.
34.
Robert C. Leachman 《海军后勤学研究》1982,29(1):47-54
Production planning for large-scale production systems requiring the allocation of numerous resources is considered. It is demonstrated how the dynamic activity analysis developed by Shephard leads to linear programming solutions of production planning problems. Three types of planning problems are formulated: maximization of output levels for a given time horizon; minimization of production duration for given output histories; and minimization of production costs for given output histories. 相似文献
35.
This paper analyzes the problem of determining desirable spares inventory levels for repairable items with dependent repair times. The problem is important for repairable products such as aircraft engines which can have very large investment in spares inventory levels. While existing models can be used to determine optimal inventory spares levels when repair times are independent, the practical considerations of limited repair shop capacity and prioritized shop dispatching rules combine to make repair times not independent of one another. In this research a simulation model of a limited capacity repair facility with prioritized scheduling is used to explore a variety of heuristic approaches to the spares stocking decision. The heuristics are also compared with use of a model requiring independent repair times (even though that assumption is not valid here). The results show that even when repair time dependencies are present, the performance of a model which assumes independent repair times is quite good. 相似文献
36.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
37.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
38.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
39.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts. 相似文献
40.
Christopher D. Kolenda 《战略研究杂志》2019,42(7):992-1014
ABSTRACTThe United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations. 相似文献