全文获取类型
收费全文 | 578篇 |
免费 | 9篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 104篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 23篇 |
2009年 | 15篇 |
2008年 | 30篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 12篇 |
1986年 | 13篇 |
1985年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1973年 | 4篇 |
1972年 | 14篇 |
1971年 | 3篇 |
1970年 | 5篇 |
1969年 | 11篇 |
1968年 | 7篇 |
1967年 | 4篇 |
1966年 | 5篇 |
排序方式: 共有587条查询结果,搜索用时 15 毫秒
241.
Andrew L. Rukhin 《海军后勤学研究》1986,33(1):91-99
The estimation problem of normal tail probabilities is considered. The form of generalized Bayes estimators is derived and the asymptotic behavior of the mean square errors is studied. This study shows that the best unbiased estimator, a formula for which is given, is superior to the maximum likelihoood estimator or to a class of generalized Bayes procedures for large parametric values, but can be significantly improved for moderate values of the parameter. 相似文献
242.
243.
244.
This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented. 相似文献
245.
In this paper we consider the multiproduct, multiperiod production-scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production-run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures. 相似文献
246.
Bryan L. Deuermeyer 《海军后勤学研究》1980,27(2):177-185
This paper develops a single period model for a specific class of multiproduct perishable inventory systems where demands are interdependent. This class of inventory systems has the property that there is economic substitution between products. It is shown that the optimal policy has the economic substitution property, and that the rate of substitution is age dependent. The model serves as a generalization of a theorem discovered by Ignall and Veinott. 相似文献
247.
248.
249.
A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context. 相似文献
250.
A dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each of n sinks for T periods which can be fulfilled by shipments from m sources. A requirement in period t2 can be satisfied by a shipment in the same period (a linear shipping cost is incurred) or by a shipment in period t1 < t2 (in addition to the linear shipping cost a linear inventory cost is incurred for every period in which the commodity is stored). A well known method for solving this problem is to transform it into an equivalent single period transportation problem with mT sources and nT sinks. Our approach treats the model as a transshipment problem consisting of T, m source — n sink transportation problems linked together by inventory variables. Storage requirements are proportional to T2 for the single period equivalent transportation algorithm, proportional to T, for our algorithm without decomposition, and independent of T for our algorithm with decomposition. This storage saving feature enables much larger problems to be solved than were previously possible. Futhermore, we can easily incorporate upper bounds on inventories. This is not possible in the single period transportation equivalent. 相似文献