全文获取类型
收费全文 | 523篇 |
免费 | 28篇 |
国内免费 | 5篇 |
出版年
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 10篇 |
2016年 | 12篇 |
2015年 | 17篇 |
2014年 | 11篇 |
2013年 | 67篇 |
2012年 | 33篇 |
2011年 | 31篇 |
2010年 | 28篇 |
2009年 | 22篇 |
2008年 | 34篇 |
2007年 | 23篇 |
2006年 | 18篇 |
2005年 | 14篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1989年 | 13篇 |
1987年 | 2篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有556条查询结果,搜索用时 31 毫秒
51.
52.
影响图建模算法的改进 总被引:1,自引:0,他引:1
影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组. 相似文献
53.
为了构造在光滑区具有较高分辨率并且可以无振荡捕捉激波的高精度有限体积格式,同时降低格式在模板选择上遇到的困难,基于逐维重构方法,发展了结构网格下的高精度有限体积格式,并将这一格式推广到三维曲线坐标系下,从而可以适应相对复杂外形下的计算。为充分验证格式的有效性,选取一系列典型算例进行计算:在等熵涡输运和二维喷管流动中验证了格式的精度可以达到设计精度;在双马赫反射问题中格式也表现出良好的捕捉激波的能力。数值计算表明,上述格式在曲线网格上具有较高的数值精度和鲁棒的激波捕捉能力,适用于流体力学方程的计算。 相似文献
54.
55.
56.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
57.
Dan Wilson 《海军后勤学研究》1975,22(1):181-187
Among the many tools of the operations researcher is the transportation algorithm which has been used to solve a variety of problems ranging from shipping plans to plant location. An important variation of the basic transportation problem is the transportation problem with stochastic demand or stochastic supply. This paper presents a simple approximation technique which may be used as a starting solution for algorithms that determine exact solutions. The paper indicates that the approximation technique offered here is superior to a starting solution obtained by substituting expected demand for the random variables. 相似文献
58.
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. 相似文献
59.
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. 相似文献
60.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献