全文获取类型
收费全文 | 9395篇 |
免费 | 329篇 |
国内免费 | 355篇 |
专业分类
化学 | 186篇 |
晶体学 | 1篇 |
力学 | 285篇 |
综合类 | 106篇 |
数学 | 9233篇 |
物理学 | 268篇 |
出版年
2023年 | 37篇 |
2022年 | 71篇 |
2021年 | 97篇 |
2020年 | 97篇 |
2019年 | 128篇 |
2018年 | 130篇 |
2017年 | 179篇 |
2016年 | 180篇 |
2015年 | 147篇 |
2014年 | 384篇 |
2013年 | 437篇 |
2012年 | 501篇 |
2011年 | 367篇 |
2010年 | 373篇 |
2009年 | 557篇 |
2008年 | 578篇 |
2007年 | 648篇 |
2006年 | 459篇 |
2005年 | 411篇 |
2004年 | 333篇 |
2003年 | 317篇 |
2002年 | 323篇 |
2001年 | 282篇 |
2000年 | 334篇 |
1999年 | 250篇 |
1998年 | 242篇 |
1997年 | 231篇 |
1996年 | 216篇 |
1995年 | 197篇 |
1994年 | 147篇 |
1993年 | 156篇 |
1992年 | 141篇 |
1991年 | 134篇 |
1990年 | 107篇 |
1989年 | 70篇 |
1988年 | 93篇 |
1987年 | 60篇 |
1986年 | 83篇 |
1985年 | 116篇 |
1984年 | 86篇 |
1983年 | 25篇 |
1982年 | 55篇 |
1981年 | 47篇 |
1980年 | 41篇 |
1979年 | 34篇 |
1978年 | 51篇 |
1977年 | 55篇 |
1976年 | 28篇 |
1975年 | 13篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
1.
This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent
uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly,
strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive
Banach spaces.
Supported by NSFC 相似文献
2.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
3.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
4.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
5.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
6.
Stefan Nörtemann 《Applied Categorical Structures》2002,10(4):417-429
The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C
0 of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved. 相似文献
7.
Boban Marinković 《Mathematical Methods of Operations Research》2006,63(3):513-524
We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. 相似文献
8.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
9.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
10.
Constraint Programming and Operations Research: Comments from an Operations Researcher 总被引:4,自引:0,他引:4
Michel Gendreau 《Journal of Heuristics》2002,8(1):19-24
This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research. 相似文献