全文获取类型
收费全文 | 816篇 |
免费 | 19篇 |
出版年
2021年 | 18篇 |
2019年 | 28篇 |
2018年 | 12篇 |
2017年 | 18篇 |
2016年 | 17篇 |
2015年 | 21篇 |
2014年 | 16篇 |
2013年 | 157篇 |
2008年 | 9篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 21篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 20篇 |
1989年 | 14篇 |
1988年 | 20篇 |
1987年 | 19篇 |
1986年 | 23篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 21篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 10篇 |
1969年 | 11篇 |
1968年 | 7篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有835条查询结果,搜索用时 15 毫秒
801.
P. S. Dwyer 《海军后勤学研究》1974,21(3):445-464
This paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit, N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix. C*, to which the so-called transportation paradox does not apply. The general Hitchcock solution using C* gives the cost T*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value of Nu, the unbounded N for minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution using C* can provide the general answer, (d) how the results may be modified to apply to problems with fixed N, and hence (e) to determine the function of the decreasing T as N approaches Nu, and finally (f) to provide a treatment when the supplies at origin i and/or the demands at destination j, are bounded. 相似文献
802.
Gary M. Roodman 《海军后勤学研究》1974,21(4):595-607
This paper develops a method for doing postoptimality analysis on the mixed integer programming problem. The proposed procedures form a natural adjunct to enumerative I.P. algorithms that are linear programming based, and they are designed, in effect, to capitalize on insights generated as the problem is initially solved to do subsequent analysis upon it. In particular, limited ranging analysis is possible on selected parameters, as is the efficient resolving of the problem following parameter changes. 相似文献
803.
804.
The location-allocation problem for existing facilities uniformly distributed over rectangular regions is treated for the case where the rectilinear norm is used. The new facilities are to be located such that the expected total weighted distance is minimized. Properties of the problem are discussed. A branch and bound algorithm is developed for the exact solution of the problem. Computational results are given for different sized problems. 相似文献
805.
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed. 相似文献
806.
William S. Griffith 《海军后勤学研究》1982,29(1):63-74
In a 1973 paper J. D. Esary, A. W. Marshall, and F. Proschan [5] considered a shock model giving rise to various nonparametric classes of life distributions of interest in reliability theory. A number of authors have extended these results in a variety of directions. In this paper, alternative proofs of the increasing failure rate (IFR) and decreasing mean residual life (DMRL) results are given which do not make use of the theory of total positivity. Some bivariate extensions are then obtained using a shock model similar to that originally used by H. W. Block, A. S. Paulson, and R. C. Kohberger [2] to unify various bivariate exponential distributions. 相似文献
807.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
808.
An approach is presented for obtaining the moments and distribution of the optimal value for a class of prototype stochastic geometric programs with log-normally distributed cost coefficients. It is assumed for each set of values taken on by the cost coefficients that the resulting deterministic primal program is superconsistent and soluble. It is also required that the corresponding dual program has a unique optimal point with all positive components. It is indicated how one can apply the results obtained under the above assumptions to stochastic programs whose corresponding deterministic dual programs need not satisfy the above-mentioned uniqueness and positivity requirements. 相似文献
809.
This article proposes a practical, data-based statistical procedure which can be used to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state means. We discuss results of experiments designed to choose good parameter values for this procedure, and present results of extensive testing of the procedure on a variety of stochastic models for which partial analytical results are available. The article closes with two illustrations of the application of the procedure to more complex statistical problems which are more representative of the kinds of purposes for which real-world steady-state simulation studies might be undertaken. 相似文献
810.
Everette S. Gardner 《海军后勤学研究》1983,30(1):59-68
Constrained multi-item inventory models have long presented signifcant computational problems. This article presents a general algorithm to obtain simultaneous solutions for order quantities and safety stocks for each line item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Computational experience is presented that demonstrates the algorithm's efficiency in handling large-scale applications. Decision rules for several customer service objectives are developed, with a discussion of the characteristics of the inventory systems in which each objective would be most appropriate. The decision rules are approximations, based on the assumptions commonly used in practice. 相似文献