全文获取类型
收费全文 | 9073篇 |
免费 | 412篇 |
国内免费 | 378篇 |
专业分类
化学 | 408篇 |
晶体学 | 5篇 |
力学 | 393篇 |
综合类 | 102篇 |
数学 | 8394篇 |
物理学 | 561篇 |
出版年
2023年 | 43篇 |
2022年 | 88篇 |
2021年 | 94篇 |
2020年 | 106篇 |
2019年 | 118篇 |
2018年 | 132篇 |
2017年 | 171篇 |
2016年 | 184篇 |
2015年 | 131篇 |
2014年 | 378篇 |
2013年 | 489篇 |
2012年 | 510篇 |
2011年 | 399篇 |
2010年 | 393篇 |
2009年 | 554篇 |
2008年 | 578篇 |
2007年 | 629篇 |
2006年 | 457篇 |
2005年 | 387篇 |
2004年 | 312篇 |
2003年 | 329篇 |
2002年 | 302篇 |
2001年 | 268篇 |
2000年 | 272篇 |
1999年 | 233篇 |
1998年 | 206篇 |
1997年 | 189篇 |
1996年 | 213篇 |
1995年 | 186篇 |
1994年 | 136篇 |
1993年 | 141篇 |
1992年 | 140篇 |
1991年 | 134篇 |
1990年 | 103篇 |
1989年 | 71篇 |
1988年 | 94篇 |
1987年 | 54篇 |
1986年 | 84篇 |
1985年 | 119篇 |
1984年 | 80篇 |
1983年 | 23篇 |
1982年 | 55篇 |
1981年 | 44篇 |
1980年 | 35篇 |
1979年 | 31篇 |
1978年 | 51篇 |
1977年 | 49篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有9863条查询结果,搜索用时 15 毫秒
131.
C. Zălinescu 《Mathematical Methods of Operations Research》1991,35(4):291-298
In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems. 相似文献
132.
J. Fülöp 《Mathematical Methods of Operations Research》1991,35(1):1-13
This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.
Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.相似文献
133.
Oscar Valero 《Proceedings Mathematical Sciences》2006,116(2):175-191
Given a normed cone (X, p) and a subconeY, we construct and study the quotient normed cone (X/Y,p) generated byY. In particular we characterize the bicompleteness of (X/Y, ‖·‖
p
,p) in terms of the bicompleteness of (X, p), and prove that the dual quotient cone ((X/Y)*, || · ‖·‖p,p) can be identified as a distinguished subcone of the dual cone (X
*, || · ||p, u). Furthermore, some parts of the theory are presented in the general setting of the spaceCL(X, Y) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces. 相似文献
134.
Stanislav Busygin 《Discrete Applied Mathematics》2006,154(15):2080-2096
A new simple generalization of the Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within this framework a trust region heuristic is developed. In contrast to usual trust region methods, it regards not only the global optimum of a quadratic objective over a sphere, but also a set of other stationary points of the program. We formulate and prove a condition when a Motzkin-Straus optimum coincides with such a point. The developed method has complexity O(n3), where n is the number of vertices of the graph. It was implemented in a publicly available software package QUALEX-MS.Computational experiments indicate that the algorithm is exact on small graphs and very efficient on the DIMACS benchmark graphs and various random maximum weight clique problem instances. 相似文献
135.
一类二阶两点边值问题的单调迭代方法 总被引:2,自引:0,他引:2
姚庆六 《应用数学与计算数学学报》2002,16(2):80-84
通过改进经典的单调迭代方法对于一类二阶两点边值的问题的正解建立了单调迭代程序。这些迭代程序都是从常值函数开始的,因而是可行并且有效的。 相似文献
136.
137.
Banach空间二阶非线性脉冲微分-积分方程的极值解 总被引:1,自引:0,他引:1
通过建立一个新的比较定理研究了B anach空间二阶非线性混合型脉冲微分-积分方程初值问题的极值解,所得结果推广和改进了现有文献的主要结果. 相似文献
138.
We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times. 相似文献
139.
We consider in this paper the Lagrangian dual method for solving general integer programming. New properties of Lagrangian
duality are derived by a means of perturbation analysis. In particular, a necessary and sufficient condition for a primal
optimal solution to be generated by the Lagrangian relaxation is obtained. The solution properties of Lagrangian relaxation
problem are studied systematically. To overcome the difficulties caused by duality gap between the primal problem and the
dual problem, we introduce an equivalent reformulation for the primal problem via applying a pth power to the constraints. We prove that this reformulation possesses an asymptotic strong duality property. Primal feasibility
and primal optimality of the Lagrangian relaxation problems can be achieved in this reformulation when the parameter p is larger than a threshold value, thus ensuring the existence of an optimal primal-dual pair. We further show that duality
gap for this partial pth power reformulation is a strictly decreasing function of p in the case of a single constraint.
Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. Research supported by the Research Grants Council
of Hong Kong under Grant CUHK 4214/01E, and the National Natural Science Foundation of China under Grants 79970107 and 10571116. 相似文献
140.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献