全文获取类型
收费全文 | 291篇 |
免费 | 4篇 |
出版年
2021年 | 4篇 |
2019年 | 3篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 69篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 7篇 |
1971年 | 8篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 2篇 |
1948年 | 3篇 |
排序方式: 共有295条查询结果,搜索用时 375 毫秒
61.
This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given. 相似文献
62.
W. L. Wilkinson 《海军后勤学研究》1973,20(3):505-516
This paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal are flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. 相似文献
63.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
64.
Alan J. Kaplan 《海军后勤学研究》1976,23(4):687-695
We address a single product, continuous review model with stationary Poisson demand. Such a model has been effectively studied when mean demand is known. However, we are concerned with managing new items for which only a Bayesian prior distribution on the mean is available. As demand occurs, the prior is updated and our control parameters are revised. These include the reorder point (R) and reorder quantity (Q). Deemer, taking a clue from some earlier RAND work, suggested using a model appropriate for known mean, but using a Compound Poisson distribution for demand rather than Poisson to reflect uncertainty about the mean. Brown and Rogers also used this approach but within a periodic review context. In this paper we show how to compute optimum reorder points for a special problem closely related to the problem of real interest. In terms of the real problem, subject to a qualification to be discussed, the reorder points found are upper bounds for the optimum. At the same time, the reorder points found can never exceed those found by the Compound Poisson (Deemer) approach. And they can be smaller than those found when there is no uncertainty about the mean. As a check, the Compound Poisson and proposed approach are compared by simulation. 相似文献
65.
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. 相似文献
66.
Manfred W. Padberg 《海军后勤学研究》1972,19(4):699-708
In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem. 相似文献
67.
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. 相似文献
68.
A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example. 相似文献
69.
Mary W. Cooper 《海军后勤学研究》1980,27(1):89-95
This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem. 相似文献
70.
A discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times. 相似文献