全文获取类型
收费全文 | 453篇 |
免费 | 17篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 80篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 3篇 |
1968年 | 6篇 |
1967年 | 5篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
111.
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. 相似文献
112.
113.
114.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
115.
George S. Fishman 《海军后勤学研究》1985,32(2):249-261
This article describes a new procedure for estimating parameters of a stochastic activity network of N arcs. The parameters include the probability that path m is the longest path, the probability that path m is the shortest path, the probability that arc i is on the longest path, and the probability that arc i is on the shortest path. The proposed procedure uses quasirandom points together with information on a cutset ? of the network to produce an upper bound of O[(log K)N?|?|+1/K] on the absolute error of approximation, where K denotes the number of replications. This is a deterministic bound and is more favorable than the convergence rate of 1/K1/2 that one obtains from the standard error for K independent replications using random sampling. It is also shown how series reduction can improve the convergence rate by reducing the exponent on log K. The technique is illustrated using a Monte Carlo sampling experiment for a network of 16 relevant arcs with a cutset of ? = 7 arcs. The illustration shows the superior performance of using quasirandom points with a cutset (plan A) and the even better performance of using quasirandom points with the cutset together with series reduction (plan B) with regard to mean square error. However, it also shows that computation time considerations favor plan A when K is small and plan B when K is large. 相似文献
116.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
117.
线性运动在精密工程中被广泛应用。由于寄生运动的存在,要实现线性工作台或轴承完美无缺的直线运动几乎是不可能的。这些寄生运动包括:两个方向的平动(y和z),三个方向的转动,即滚动(Φ_x),垂直俯仰(Φ_y),水平晃动(Φ_z)。使用机械元件,这些寄生运动的数量级分别为1μm和1mrad。修改机械设计来增加直线运动的精度通常是困难的而 相似文献
118.
Robert C. Gray 《Defense & Security Analysis》1998,14(2):199-204
A Study of War by Quincy Wright, Second edition. Chicago: University of Chicago Press, 1965, 1,637 pp. 相似文献
119.
120.