全文获取类型
收费全文 | 89篇 |
免费 | 3篇 |
出版年
2021年 | 2篇 |
2017年 | 5篇 |
2016年 | 1篇 |
2015年 | 3篇 |
2013年 | 15篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2008年 | 1篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2004年 | 1篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有92条查询结果,搜索用时 31 毫秒
1.
This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated. 相似文献
2.
Richard V. Evans 《海军后勤学研究》1969,16(1):85-92
The system to be controlled produces n products simultaneously in fixed proportions every time it is activated. Demands for the products in any period are components of an n dimensional vector random variable with known distribution function. Cases of excess demands backlogged and excess demands lost are considered. In the former the notion of k convexity can be generalized to guarantee relatively simple form for the optimal policy in an n decision problem. In the latter, this generalization was not successful although when there is no setup cost, a convexity argument can be used to show that the optimal policy has a simple form. 相似文献
3.
Stochastic combat models are more realistic than either deterministic or exponential models. Stochastic combat models have been solved analytically only for small combat sizes. It is very difficult, if not impossible, to extend previous solution techniques to larger-scale combat. This research provides the solution for many-on-many heterogeneous stochastic combat with any break points. Furthermore, every stage in stochastic combat is clearly defined and associated aiming and killing probabilities are calculated. © 1996 John Wiley & Sons, Inc. 相似文献
4.
Boland, Proschan, and Tong [2] used the notion of criticality of nodes in a coherent system to study the optimal component arrangement of reliability structures. They also provided a sufficient minimal cut (path) based criterion for verifying the criticality ordering of two nodes. We develop a necessary and sufficient condition for two nodes to be comparable and provide specific examples illustrating our result's applicability. As a corollary, certain optimal arrangement properties of well-known systems are derived. © 1994 John Wiley & Sons, Inc. 相似文献
5.
Bibhu Prasad Routray 《Small Wars & Insurgencies》2017,28(1):57-80
India’s success in dealing with insurgency movements was based on adherence to four key rules of engagement: identifying a lead counter-insurgent force, launching population-centric counterinsurgency (COIN) operations, non-use of excessive force and confining the role of the COIN operations to preparing a ground for a political solution. While the country does not yet have a COIN doctrine, these four rules of engagement do constitute what can be referred to a COIN grand strategy. Analysis of the several continuing insurgencies, however, reveals the country’s inability to adhere to the grand strategy. Political considerations, incapacity to manoeuvre through the demands of various stake holders, and even the wish to expedite the decimation of insurgent outfits through a force-centric approach has produced a long history of failures in dousing the fires of discontent. 相似文献
6.
针对非线性非高斯导航系统信息处理问题,采用自组织算法、神经网络和遗传算法等改进传统非线性Kalman滤波算法,构建一种自适应的组合导航系统。应用具有冗余趋势项的自组织算法、Volterra神经网络和遗传算法,建立导航系统误差的非线性预测模型,进而计算得到其预测值;将该预测值与Kalman滤波算法求得的估计值进行比较得到差值,以此监测Kalman滤波算法的工作状态;采用自适应控制方法,在导航系统结构层面改进Kalman滤波算法,构建新型的导航系统误差补偿模型。开展基于导航系统KIND-34的半实物仿真研究,应用所提出的改进方法改善了导航系统误差的补偿效果,提高了组合导航系统的自适应能力和容错能力。 相似文献
7.
Its long history and destabilising impact notwithstanding, banditry has received scant academic attention in India. Confined mostly to occasional and incident-driven media reportage, the socioeconomic factors that fuelled insurgencies and banditry and the milieu which provided a context for the operations of these outlawed movements received little attention. Cinematic representation of the social banditry phenomenon in the country, based on little or no first-hand research, as a result, suffered from ingenuousness and failed to emerge from the romanticised depiction of insurgency and terrorism which Bollywood, India's movie industry, is known for. Bandit Queen, the biopic of Phoolan Devi, in contrast, stands apart. Scathing criticisms regarding its use of sex as a tool for commercial success notwithstanding, the movie succeeds in drawing the viewers' attention to the persisting social cleavages in India. Using rape as its central theme, it shocks its audience into acknowledging the reality and relevance of social banditry in a country where governance remains an absent entity for a vast majority of its people. That most Bollywood movies depicting social issues have continued to remain aground in romanticism and irrelevance makes Bandit Queen even more relevant in times to come. 相似文献
8.
This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph-theoretic approach is utilized to define the basis as a one-forest consisting of one-trees (a tree with an extra edge). Algorithmic development of the pivot-step is presented by the representation of a two-tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper. 相似文献
9.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved. 相似文献
10.
We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998 相似文献