全文获取类型
收费全文 | 1062篇 |
免费 | 22篇 |
出版年
2021年 | 12篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 227篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 30篇 |
1987年 | 22篇 |
1986年 | 35篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 12篇 |
1972年 | 15篇 |
1971年 | 9篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1967年 | 8篇 |
排序方式: 共有1084条查询结果,搜索用时 15 毫秒
981.
The location-allocation problem for existing facilities uniformly distributed over rectangular regions is treated for the case where the rectilinear norm is used. The new facilities are to be located such that the expected total weighted distance is minimized. Properties of the problem are discussed. A branch and bound algorithm is developed for the exact solution of the problem. Computational results are given for different sized problems. 相似文献
982.
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed. 相似文献
983.
The stochastic duel is extended to include the possibility of a near-miss on each round fired, which causes the opponent to displace. During displacement, the displacing contestant cannot return the fire but is still a target for his opponent. An alternative interpretation of this model is to consider the displacement time as the time a contestant's fire is suppressed by his opponent's fire and that he does not move, but merely ceases fire temporarily. All times are exponentially distributed. 相似文献
984.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
985.
William S. Griffith 《海军后勤学研究》1982,29(1):63-74
In a 1973 paper J. D. Esary, A. W. Marshall, and F. Proschan [5] considered a shock model giving rise to various nonparametric classes of life distributions of interest in reliability theory. A number of authors have extended these results in a variety of directions. In this paper, alternative proofs of the increasing failure rate (IFR) and decreasing mean residual life (DMRL) results are given which do not make use of the theory of total positivity. Some bivariate extensions are then obtained using a shock model similar to that originally used by H. W. Block, A. S. Paulson, and R. C. Kohberger [2] to unify various bivariate exponential distributions. 相似文献
986.
The loading problem involves the optimal allocation of n objects, each having a specified weight and value, to m boxes, each of specified capacity. While special cases of these problems can be solved with relative ease, the general problem having variable item weights and box sizes can become very difficult to solve. This paper presents a heuristic procedure for solving large loading problems of the more general type. The procedure uses a surrogate procedure for reducing the original problem to a simpler knapsack problem, the solution of which is then employed in searching for feasible solutions to the original problem. The procedure is easy to apply, and is capable of identifying optimal solutions if they are found. 相似文献
987.
This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions. 相似文献
988.
Uday S. Karmarkar 《海军后勤学研究》1979,26(1):1-19
This paper examines a convex programming problem that arises in several contexts. In particular, the formulation was motivated by a generalization of the stochastic multilocation problem of inventory theory. The formulation also subsumes some “active” models of stochastic programming. A qualititative analysis of the problem is presented and it is shown that optimal policies have a certain geometric form. Properties of the optimal policy and of the optimal value function are described. 相似文献
989.
Peter J. Kolesar 《海军后勤学研究》1967,14(3):317-327
Several problems in the assignment of parallel redundant components to systems composed of elements subject to failure are considered. In each case the problem is to make an assignment which maximizes the system reliability subject to system constraints. Three distinct problems; are treated. The first is the classical problem of maximizing system reliability under total cost or weight constraints when components are subject to a single type of failure. The second problem deals with components which are subject to two types of failure and minimizes the probability of one mode of system failure subject to a constraint on the probability of the other mode of system failure. The third problem deals with components which may either fail to operate or may operate prematurely. System reliability is maximized subject to a constraint ori system safety. In each case the problem is formulated as an integer linear program. This has an advantage over alternative dynamic programming formulations in that standard algorithms may be employed to obtain numerical results. 相似文献
990.
This paper deals with the analysis of a model for studying the probability of survival of a subterranean target under an intensive attack. Most of the analysis is based on the assumption that the explosions are circularly distributed about the target and that the number of explosions is known. In the last two sections it is shown what effect a relaxation of these assumptions has on the probability of survival of the target. 相似文献