全文获取类型
收费全文 | 367篇 |
免费 | 21篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 69篇 |
2012年 | 7篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 10篇 |
1992年 | 10篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有389条查询结果,搜索用时 125 毫秒
81.
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. 相似文献
82.
83.
首先分析了加工时零件表面热量场和加工参数、余量场之间的关系;利用数字扫描及滤波的方法建立起复杂形面零件的数学模型;以此为基础,在加工过程中,对零件的几何质量和表面层质量进行了综合控制。研究表明,该方法是提高飞行器发动机中高负载复杂形状薄壁零件可靠性和寿命的有效新途径。 相似文献
84.
85.
86.
During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds. 相似文献
87.
This paper investigates the effect of the optimal solution of a (capacitated) generalized transportation problem when the data of the problem (the rim conditions—i.e., the available time of machine types and demands of product types, the per unit production costs, the per unit production time and the upper bounds) are continuously varied as a linear function of a single parameter. Operators that effect the transformation of optimal solution associated with such data changes, are shown to be a product of basis preserving operators (described in our earlier papers) that operate on a sequence of adjacent basis structures. Algorithms are furnished for the three types of operators—rim, cost, and weight. The paper concludes with a discussion of the production and managerial interpretations of the operators and a comment on the “production paradox”. 相似文献
88.
Bol has discussed consequences of the continuity of production correspondences in connection with relations between efficient input and output vectors. Isoquants of continuous production correspondences are used here to extend this work. Simplifications to existing theory are discussed. 相似文献
89.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed. 相似文献
90.