全文获取类型
收费全文 | 492篇 |
免费 | 23篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 13篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 10篇 |
2013年 | 125篇 |
2012年 | 7篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2000年 | 5篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 13篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有516条查询结果,搜索用时 15 毫秒
121.
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. 相似文献
122.
123.
首先分析了加工时零件表面热量场和加工参数、余量场之间的关系;利用数字扫描及滤波的方法建立起复杂形面零件的数学模型;以此为基础,在加工过程中,对零件的几何质量和表面层质量进行了综合控制。研究表明,该方法是提高飞行器发动机中高负载复杂形状薄壁零件可靠性和寿命的有效新途径。 相似文献
124.
125.
126.
127.
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. 相似文献
128.
In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing. 相似文献
129.
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”. 相似文献
130.
Michael H. Rothkopf 《海军后勤学研究》1975,22(4):829-830
A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence. 相似文献