全文获取类型
收费全文 | 461篇 |
免费 | 11篇 |
国内免费 | 1篇 |
出版年
2019年 | 10篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2010年 | 9篇 |
2007年 | 6篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有473条查询结果,搜索用时 31 毫秒
101.
John J. Jarvis 《海军后勤学研究》1969,16(4):525-529
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence. 相似文献
102.
Charles H. Falkner 《海军后勤学研究》1969,16(3):287-295
A mathematical model is formulated for determining the number of spare components to purchase when components stochastically fail according to a known life distribution function and there is a cost incurred when a component is replaced. Bounds are determined for the optimal inventory which indicate that the inclusion of the replacement cost lowers the optimal inventory. Since these bounds are no easier to calculate than the optimal spares level, the theory is specialized to components with exponentially distributed time to failure. Procedures are given for calculating the optimal spares level, and numerical examples are provided. 相似文献
103.
104.
105.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
106.
Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach. 相似文献
107.
John G. Rau 《海军后勤学研究》1971,18(4):543-559
A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort. 相似文献
108.
109.
Soung H. Kim 《海军后勤学研究》1985,32(4):647-651
The Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known. 相似文献
110.