全文获取类型
收费全文 | 638篇 |
免费 | 13篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 16篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2014年 | 12篇 |
2013年 | 153篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 19篇 |
1996年 | 11篇 |
1994年 | 13篇 |
1992年 | 7篇 |
1991年 | 16篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有651条查询结果,搜索用时 31 毫秒
441.
Harvey M. Salkin 《海军后勤学研究》1972,19(2):399-402
Glover and Young, References [4] and [8], respectively, present convergent primal integer programming algorithms. The algorithm outlined in Young's paper (which was deliberately specialized) is shown to be a special case of the Glover algorithm under his acceptable source row selection, Rule 1. 相似文献
442.
The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally. 相似文献
443.
Howard M. Taylor 《海军后勤学研究》1975,22(1):1-18
A machine or production system is subject to random failure. Upon failure the system is replaced by a new one, and the process repeats. A cost is associated with each replacement, and an additional cost is incurred at each failure in service. Thus, there is an incentive for a controller to attempt to replace before failure occurs. The problem is to find an optimal control strategy that balances the cost of replacement with the cost of failure and results in a minimum total long-run average cost per unit time. We attack this problem under the cumulative damage model for system failure. In this failure model, shocks occur to the system in accordance with a Poisson process. Each shock causes a random amount of damage or wear and these damages accumulate additively. At any given shock, the system fails with a known probability that depends on the total damage accumulated to date. We assume that the cumulative damage is observable by the controller and that his decisions may be based on its current value. Supposing that the shock failure probability is an increasing function of the cumulative damage, we show that an optimal policy is to replace either upon failure or when this damage first exceeds a critical control level, and we give an equation which implicitly defines the optimal control level in terms of the cost and other system parameters. Also treated are some more general models that allow for income lost during repair time and other extensions. 相似文献
444.
A model of an M/M/1, bulk queue with service rates dependent on the batch size is developed. The operational policy is to commence service when at least L customers are available with a maximum batch size of K. Arriving customers are not allowed to join in-process service. The solution procedure utilizes the matrix geometric methodology and reduces to obtaining the inverse of a square matrix of dimension K + 1 - L. For the case where the service rates are not batch size dependent, the limiting probabilities can be written in closed form. A numerical example illustrates the variability of the system cost as a function of the minimum batch service size L. 相似文献
445.
A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue. 相似文献
446.
There are a great number of queueing systems, including the MX/MY/c, the GlX/M/c and the discrete Gl/G/1 queue in which the state probabilities are determined by repeated queue equations. This paper gives a simple, efficient and numerically stable algorithm to caiculate the state probabilities and measure of performance for such systems. The method avoids both complex arithmetric and matrix manipulations. 相似文献
447.
Certain types of communication nodes can be viewed as multichannel queueing systems with two types of arrival streams. Data arrivals are characterized by high arrival and service rates and have the ability to queue if all service channels are busy. Voice arrivals have small arrival and service rates and do not have the ability to wait when the channels are full. Computational procedures are presented for obtaining the invariant probabilities associated with the queueing model. 相似文献
448.
In this paper formulas are derived for the reliability of a single unit to which identical spares in standby are allocated, with all of these units having a hyper-exponential or Erlang distributed lifetime. Two advantages are obtained by using these distributions. First, the general procedure for calculating the effect of redundancy is applicable, in contrast with most of the common life distributions, such as Weibull. Moreover, both distributions are suitable for matching to observed curves and practical data by varying the values of the parameters, covering together most of the cases of practical interest. 相似文献
449.
We consider groups of tests for personnel selection purposes in which each test has a known a priori probability of being failed, such failure resulting in outright rejection and termination of testing. Each test has a fixed cost and given duration. We consider the minimization of the total expected cost due to both the fixed costs and the delay costs when the tests may be conducted sequentially or in parallel. In the latter situation, a heuristic algorithm is proposed and illustrated. 相似文献
450.
The integer programming literature contains many algorithms for solving all-integer programming problems but, in general, existing algorithms are less than satisfactory even in solving problems of modest size. In this paper we present a new technique for solving the all-integer, integer programming problem. This algorithm is a hybrid (i.e., primal-dual) cutting-plane method which alternates between a primal-feasible stage related to Young's simplified primal algorithm, and a dual-infeasible stage related to Gomory's dual all-integer algorithm. We present the results of computational testing. 相似文献