全文获取类型
收费全文 | 567篇 |
免费 | 7篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 9篇 |
2017年 | 19篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 13篇 |
2013年 | 105篇 |
2012年 | 23篇 |
2011年 | 26篇 |
2010年 | 23篇 |
2009年 | 15篇 |
2008年 | 27篇 |
2007年 | 14篇 |
2006年 | 15篇 |
2005年 | 5篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 12篇 |
1988年 | 6篇 |
1987年 | 12篇 |
1986年 | 12篇 |
1985年 | 9篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 5篇 |
1966年 | 3篇 |
排序方式: 共有574条查询结果,搜索用时 15 毫秒
221.
Donald L. Iglehart 《海军后勤学研究》1975,22(3):553-565
The regenerative method for estimating parameters in a simulation requires the simulator to estimate the ratio of two means. Five point estimates and four confidence intervals for this ratio have been computed for three stochastic simulations. The jackknife method appears to be the most promising for both point and interval estimation. 相似文献
222.
We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors. 相似文献
223.
We present some results for M/M/1 queues with finite capacities with delayed feedback. The delay in the feedback to an M/M/1 queue is modelled as another M-server queue with a finite capacity. The steady state probabilities for the two dimensional Markov process {N(t), M(t)} are solved when N(t) = queue length at server 1 at t and M(t) = queue length at server 2 at t. It is shown that a matrix operation can be performed to obtain the steady state probabilities. The eigenvalues of the operator and its eigenvectors are found. The problem is solved by fitting boundary conditions to the general solution and by normalizing. A sample problem is run to show that the solution methods can be programmed and meaningful results obtained numerically. 相似文献
224.
L. Peter Jennergren 《海军后勤学研究》1977,24(2):373-376
Three different solutions to a very simple transfer pricing problem are outlined and contrasted. These are labeled by their authors: Hirshleifer, Enzer, and Ronen and McKinney. Weaknesses associated with each solution are pointed out. 相似文献
225.
226.
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. 相似文献
227.
228.
229.
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. 相似文献
230.
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. 相似文献