全文获取类型
收费全文 | 346篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 6篇 |
2016年 | 5篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 61篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2005年 | 3篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 3篇 |
排序方式: 共有361条查询结果,搜索用时 15 毫秒
161.
In this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems. 相似文献
162.
James G. Taylor 《海军后勤学研究》1983,30(2):237-260
This article develops a Lanchester-type model of large-scale conventional ground combat between two opposing forces in a “sector”. It is shown that nonlinear Helmbold-type equations of warfare with operational losses may be used to represent the loss-rate curves that have been used in many aggregated-force models. These nonlinear differential equations are used to model the attrition of combat capability (as quantified by a so-called firepower index) in conjunction with a rate-of-advance equation that relates motion of the contact zone (or FEBA) between the opposing forces to the force ratio and tactical decisions of the combatants. This simplified auxiliary model is then used to develop some important insights into the dynamics of FEBA movement used in large-scale aggregated-force models. Different types of behavior for FEBA movement over time are shown to correspond to different ranges of values for the initial force ratio, for example, an attack will “stall out” for a range of initial force ratios above a specific threshold value, but it will “break out” for force ratios above a second specific threshold value. Such FEBA-movement predictions are essentially based on being able to forecast changes over time in the force ratio. 相似文献
163.
Patrick G. McKeown 《海军后勤学研究》1981,28(4):607-617
Numerous procedures have been suggested for solving fixed charge problems. Among these are branch-and-bound methods, cutting plane methods, and vertex ranking methods. In all of these previous approaches, the procedure depends heavily on the continuous costs to terminate the search for the optimal solution. In this paper, we present a new branch-and-bound algorithm that calculates bounds separately on the sum of fixed costs and on the continuous objective value. Computational experience is shown for various standard test problems as well as for randomly generated problems. These test results are compared to previous procedures as well as to a mixed integer code. These comparisons appear promising. 相似文献
164.
165.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献
166.
James G. Taylor 《海军后勤学研究》1974,21(4):683-704
We develop solutions to two fire distribution problems for a homogeneous force in Lanchester combat against heterogeneous enemy forces. The combat continues over a period of time with a choice of tactics available to the homogeneous force and subject to change with time. In these idealized combat situations the lethality of each force's fire (as expressed by the Lanchester attrition-rate coefficient) depends upon time. Optimal fire distribution rules are developed through the combination of Lanchester-type equations for combat attrition and deterministic optimal control theory (Pontryagin maximum principle). Additionally, the theory of state variable inequality constraints is used to treat the nonnegativity of force levels. The synthesis of optimal fire distribution policies was facilitated by exploiting special mathematical structures in these problems. 相似文献
167.
This paper describes a procedure for determining if constrained transportation problems (i.e., transportation problems with additional linear constraints) can be transformed into equivalent pure transportation problems by a linear transformation involving the node constraints and the extra constraints. Our results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables. 相似文献
168.
This work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved. 相似文献
169.
We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors. 相似文献
170.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献