全文获取类型
收费全文 | 799篇 |
免费 | 21篇 |
出版年
2019年 | 24篇 |
2018年 | 13篇 |
2017年 | 21篇 |
2016年 | 17篇 |
2015年 | 20篇 |
2014年 | 21篇 |
2013年 | 182篇 |
2012年 | 7篇 |
2011年 | 13篇 |
2010年 | 11篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 14篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1999年 | 11篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 11篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1979年 | 10篇 |
1978年 | 13篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 13篇 |
1970年 | 13篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有820条查询结果,搜索用时 15 毫秒
711.
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)
712.
The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors. 相似文献
713.
David I. Steinberg 《海军后勤学研究》1970,17(2):217-235
The fixed charge problem is a nonlinear programming problem of practical interest in business and industry. Yet, until now no computationally feasible exact method of solution for large problems had been developed. In this paper an exact algorithm is presented which is computationally feasible for large problems. The algorithm is based upon a branch and bound approach, with the additional feature that the amount of computer storage required remains constant throughout (for a problem of any given size). Also presented are three suboptimal heuristic algorithms which are of interest because, although they do not guarantee that the true optimal solution will be found, they usually yield very good solutions and are extremely rapid techniques. Computational results are described for several of the heuristic methods and for the branch and bound algorithm. 相似文献
714.
The discounted return associated with a finite state Markov chain X1, X2… is given by g(X1)+ αg(X2) + α2g(X3) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere. Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well-known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono-tonely to the solution. Hence, the method is relatively free of error control problems. Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N2, than to N3. 相似文献
715.
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. 相似文献
716.
717.
Behram J. Hansotia 《海军后勤学研究》1980,27(2):257-272
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal, Exponential and Erlang. For the first two instances we extend the equivalent deterministic program to include the variance of the recourse. Finally, a simple example is given to illustrate the application of the formulas for the Erlang case. 相似文献
718.
This paper discusses situations in which the distribution of a lifetime response variable T is taken to depend upon a vector x of regressor variables. We specifically consider the case in which T, given x , has an exponential distribution, and in which x represents levels of fixed factors in an experimental design. Methods of analyzing data under this type of model are discussed, with maximum likelihood and least squares methods being presented and compared. 相似文献
719.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
720.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献