全文获取类型
收费全文 | 653篇 |
免费 | 13篇 |
出版年
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 15篇 |
2016年 | 14篇 |
2015年 | 9篇 |
2014年 | 13篇 |
2013年 | 85篇 |
2012年 | 22篇 |
2011年 | 28篇 |
2010年 | 24篇 |
2009年 | 17篇 |
2008年 | 30篇 |
2007年 | 14篇 |
2006年 | 18篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2002年 | 9篇 |
2001年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 18篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 14篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 12篇 |
1968年 | 8篇 |
1966年 | 4篇 |
排序方式: 共有666条查询结果,搜索用时 31 毫秒
611.
J. L. Brenner 《海军后勤学研究》1969,16(3):359-379
The chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i-th stock ni should usually be allocated in proportion to the i-th demand mi; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)
612.
The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained. 相似文献
613.
Gordon P. Wright 《海军后勤学研究》1968,15(3):375-401
The objective of this paper is to determine the optimum inventory policy for a multi-product periodic review dynamic inventory system. At the beginning of each period two decisions are made for each product. How much to “normal order” with a lead time of λn periods and how much to “emergency order” with a lead time of λe periods, where λe = λn - 1. It is assumed that the emergency ordering costs are higher than the normal ordering costs. The demands for each product in successive periods are assumed to form a sequence of independent identically distributed random variables with known densities. Demands for individual products within a period are assumed to be non-negative, but they need not be independent. Whenever demand exceeds inventory their difference is backlogged rather than lost. The ordering decisions are based on certain costs and two revenue functions. Namely, the procurement costs which are assumed to be linear for both methods of ordering, convex holding and penalty costs, concave salvage gain functions, and linear credit functions. There is a restriction on the total amount that can be emergency ordered for all products. The optimal ordering policy is determined for the one and N-period models. 相似文献
614.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators. 相似文献
615.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented. 相似文献
616.
Let be a basic solution to the linear programming problem subject to: where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these “cuts” in a specified way yields a finite dual simplex algorithm for the pure integer programming problem. The relation of these modified Dantzig cuts to Gomory cuts is discussed. 相似文献
617.
618.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved. 相似文献
619.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis-preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper. 相似文献
620.
This paper shows that by making use of an unusual property of the decision table associated with the dynamic programming solution to the goup problem, it is possible to dispense with table storage as such, and instead overlay values for both the objective and history functions. Furthermore, this storage reduction is accomplished with no loss in computational efficiency. An algorithm is presented which makes use of this technique and incorporates various additional efficiencies. The reduction in storage achieved for problems from the literature is shown. 相似文献