全文获取类型
收费全文 | 631篇 |
免费 | 19篇 |
国内免费 | 1篇 |
出版年
2021年 | 11篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 111篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2007年 | 14篇 |
2006年 | 7篇 |
2004年 | 5篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 11篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 21篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 14篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 10篇 |
1975年 | 14篇 |
1974年 | 14篇 |
1973年 | 11篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 9篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有651条查询结果,搜索用时 203 毫秒
141.
R. K. Ahuja 《海军后勤学研究》1986,33(4):725-739
In this paper, we consider a variant of the classical transportation problem as well as of the bottleneck transportation problem, which we call the minimax transportation problem. The problem considered is to determine a feasible flow xij from a set of origins I to a set of destinations J for which max(i,j)εIxJ{cijxij} is minimum. In this paper, we develop a parametric algorithm and a primal-dual algorithm to solve this problem. The parametric algorithm solves a transportation problem with parametric upper bounds and the primal-dual algorithm solves a sequence of related maximum flow problems. The primal-dual algorithm is shown to be polynomially bounded. Numerical investigations with both the algorithms are described in detail. The primal-dual algorithm is found to be computationally superior to the parametric algorithm and it can solve problems up to 1000 origins, 1000 destinations and 10,000 arcs in less than 1 minute on a DEC 10 computer system. The optimum solution of the minimax transportation problem may be noninteger. We also suggest a polynomial algorithm to convert this solution into an integer optimum solution. 相似文献
142.
Discussed in this article are tests for the extreme-value distribution, or, equivalently, for the two-parameter Weibull distribution when parameters are unknown and the sample may be censored. The three tests investigated are based on the median, the mean, and the Anderson-Darling A2 statistic calculated from a set zi of values derived from the spacings of the sample. The median and the mean have previously been discussed by Mann, Scheuer, and Fertig [10] and by Tiku and Singh [14]. Asymptotic distributions and points are given for the test statistics, based on recently developed theory, and power studies are conducted to compare them with each other and with two other statistics suitable for the test. Of the normalized spacings tests, A2 is recommended overall; the mean also gives good power in many situations, but can be nonconsistent. 相似文献
143.
We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems. 相似文献
144.
145.
146.
首先分析了加工时零件表面热量场和加工参数、余量场之间的关系;利用数字扫描及滤波的方法建立起复杂形面零件的数学模型;以此为基础,在加工过程中,对零件的几何质量和表面层质量进行了综合控制。研究表明,该方法是提高飞行器发动机中高负载复杂形状薄壁零件可靠性和寿命的有效新途径。 相似文献
147.
148.
149.
150.