全文获取类型
收费全文 | 7981篇 |
免费 | 265篇 |
国内免费 | 163篇 |
专业分类
化学 | 250篇 |
晶体学 | 1篇 |
力学 | 321篇 |
综合类 | 78篇 |
数学 | 7442篇 |
物理学 | 317篇 |
出版年
2023年 | 31篇 |
2022年 | 63篇 |
2021年 | 80篇 |
2020年 | 92篇 |
2019年 | 101篇 |
2018年 | 105篇 |
2017年 | 142篇 |
2016年 | 130篇 |
2015年 | 121篇 |
2014年 | 317篇 |
2013年 | 371篇 |
2012年 | 432篇 |
2011年 | 316篇 |
2010年 | 335篇 |
2009年 | 475篇 |
2008年 | 501篇 |
2007年 | 524篇 |
2006年 | 363篇 |
2005年 | 330篇 |
2004年 | 264篇 |
2003年 | 256篇 |
2002年 | 264篇 |
2001年 | 220篇 |
2000年 | 243篇 |
1999年 | 192篇 |
1998年 | 168篇 |
1997年 | 163篇 |
1996年 | 191篇 |
1995年 | 183篇 |
1994年 | 128篇 |
1993年 | 128篇 |
1992年 | 134篇 |
1991年 | 118篇 |
1990年 | 101篇 |
1989年 | 70篇 |
1988年 | 87篇 |
1987年 | 57篇 |
1986年 | 85篇 |
1985年 | 114篇 |
1984年 | 79篇 |
1983年 | 22篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 34篇 |
1979年 | 27篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 28篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8409条查询结果,搜索用时 312 毫秒
81.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
82.
Jesús M. Velásquez Bermúdez 《Annals of Operations Research》2002,117(1-4):21-31
This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7]. 相似文献
83.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
84.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
85.
C. D. Bisbos 《Optimization Letters》2007,1(1):101-109
Limit and shakedown analysis problems of Computational Mechanics lead to convex optimization problems, characterized by linear objective functions, linear equality constraints and constraints expressing the restrictions imposed by the material strength. It is shown that two important strength criteria, the Mohr–Coulomb and the Tresca criterion, can be represented as systems of semidefinite constraints, leading this way to semidefinite programming problems. 相似文献
86.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献
87.
In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse. 相似文献
88.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献
89.
一类特殊二维0-1规划的广义指派模型求解 总被引:2,自引:2,他引:0
二维0-1整数规划模型应用广泛,对广义指派问题的研究,解决了一些二维0-1整数规划问题.但有些实际问题具有特殊上限约束,目前还没有对应的方法.针对该实际情形,本文建立了相应的数学模型,利用对指派模型的推广,求得问题最优解,从理论上解决了这一类特殊约束二维0-1整数规划的最优解求取问题.并通过算例说明了方法的使用. 相似文献
90.
K. C. Kiwiel 《Journal of Optimization Theory and Applications》2007,134(3):549-554
We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive
in practice. Encouraging computational results are presented for large-scale problems.
The author thanks the Associate Editor and an anonymous referee for their helpful comments. 相似文献