全文获取类型
收费全文 | 447篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 17篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 105篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 7篇 |
1973年 | 4篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有463条查询结果,搜索用时 15 毫秒
421.
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. 相似文献
422.
David C. Dellinger 《海军后勤学研究》1971,18(3):357-378
A linear programming application for the selection of aircraft for a tactical airlift fleet is described. 相似文献
423.
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. 相似文献
424.
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. 相似文献
425.
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. 相似文献
426.
427.
The problem of minimizing mean flow time of two parallel processors is discussed. Prior results are briefly reviewed. A dynamic programming algorithm is presented which minimizes mean flow time for a set of n preordered jobs on two nonequivalent parallel processors. The algorithm is illustrated with an example problem. The computational experience is presented which illustrates the efficiency of the algorithm. 相似文献
428.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
429.
This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed. 相似文献
430.
Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases. 相似文献