全文获取类型
收费全文 | 375篇 |
免费 | 5篇 |
出版年
2021年 | 4篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 69篇 |
2012年 | 5篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2008年 | 6篇 |
2007年 | 3篇 |
2006年 | 4篇 |
2005年 | 3篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1972年 | 4篇 |
1971年 | 9篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有380条查询结果,搜索用时 15 毫秒
281.
282.
In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch-and-bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions. 相似文献
283.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F. 相似文献
284.
The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal. 相似文献
285.
With repeated firing, fatigue cracks are produced in a gun barrel, and the barrel is no longer useful when a crack reaches a critical size. The initial crack size and the critical crack size, as well as the number of firings producing the critical crack size, may be considered as random variables. Assuming a proportional damage model for crack growth, a method for estimating the critical crack size distribution is presented. From these results, an estimate of the barrel life, or the residual barrel life once a crack of a given size is measured, can be obtained. 相似文献
286.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc. 相似文献
287.
We examine a small lot production setting in which a machine may go out of control and begin producing defective units. Traditionally, managers have had to rely upon observations of the quality of the output to determine whether the machine is in or out of control. However, with advances in technology such as vibration analysis, it is increasingly possible to obtain much more accurate information about the state of the machine. In this paper, we model and analyze a deteriorating machine in order to gain insight into the conditions under which investments in such technology are most beneficial. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 790–808, 1999 相似文献
288.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000. 相似文献
289.
290.
In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances. 相似文献