全文获取类型
收费全文 | 437篇 |
免费 | 15篇 |
出版年
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 78篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 4篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
排序方式: 共有452条查询结果,搜索用时 31 毫秒
101.
Alan C. Wheeler 《海军后勤学研究》1972,19(4):601-619
In the finite-horizon stochastic (s, S) inventory model with periodic review the parameters of the optimal policy generally vary with the length of the horizon. A stationary policy, however, is easier to implement and may be easier to calculate. This paper studies optimal stationary policies for a finite horizon and relates them to optimal policies through their relation to optimal stationary policies for an infinite horizon. 相似文献
102.
A mathematical programming approach to identification and optimization of a class of unknown systems
Charles A. Holloway 《海军后勤学研究》1972,19(4):663-679
There exists a class of decision problems for which: (1) models of input-output response functions are not available in a closed-form, functional representation; (2) informational costs associated with learning about the response function are significant. For these problems, combining identification with optimization using mathematical programming is potentially attractive. Three approaches to the identification-optimization problem are proposed: an outer-linearized approximation using relaxation (OLR); an inner-linearized approximation using restriction (ILR); and a sequential combination of inner- and outer-linearized subproblems (SIO). Algorithms based on each approach are developed and computational experience reported. 相似文献
103.
The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph. 相似文献
104.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models. 相似文献
105.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory. 相似文献
106.
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. 相似文献
107.
Roger C. Vergin 《海军后勤学研究》1968,15(4):523-534
Most maintenance and replacement models for industrial equipment have been developed for independent single-component machines. Most equipment, however, consists of multiple components. Also, when the maintenance crew services several machines, the maintenance policy for each machine is not independent of the states of the other machines. In this paper, two dynamic programming replacement models are presented. The first is used to determine the optimal replacement policy for multi-component equipment. The second is used to determine the optimal replacement policy for a multi-machine system which uses one replacement crew to service several machines. In addition, an approach is suggested for developing an efficient replacement policy for a multi-component, multi-machine system. 相似文献
108.
109.
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. 相似文献
110.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献