全文获取类型
收费全文 | 1446篇 |
免费 | 39篇 |
国内免费 | 73篇 |
专业分类
化学 | 186篇 |
晶体学 | 2篇 |
力学 | 62篇 |
综合类 | 2篇 |
数学 | 1103篇 |
物理学 | 203篇 |
出版年
2023年 | 15篇 |
2022年 | 15篇 |
2021年 | 17篇 |
2020年 | 17篇 |
2019年 | 20篇 |
2018年 | 20篇 |
2017年 | 8篇 |
2016年 | 22篇 |
2015年 | 20篇 |
2014年 | 36篇 |
2013年 | 223篇 |
2012年 | 75篇 |
2011年 | 78篇 |
2010年 | 73篇 |
2009年 | 100篇 |
2008年 | 114篇 |
2007年 | 102篇 |
2006年 | 87篇 |
2005年 | 61篇 |
2004年 | 63篇 |
2003年 | 45篇 |
2002年 | 49篇 |
2001年 | 38篇 |
2000年 | 34篇 |
1999年 | 35篇 |
1998年 | 22篇 |
1997年 | 20篇 |
1996年 | 25篇 |
1995年 | 16篇 |
1994年 | 18篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 10篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1976年 | 5篇 |
1974年 | 1篇 |
1968年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有1558条查询结果,搜索用时 31 毫秒
71.
B. Boffey Francisco Ramón Fernández García Gilbert Laporte Juan A. Mesa Blas Pelegrín Pelegrín 《TOP》1995,3(2):167-220
Summary Many network routing problems, particularly where the transportation of hazardous materials is involved, are multiobjective
in nature; that is, it is desired to optimise not only physical path length but other features as well. Several such problems
are defined here and a general framework for multiobjective routing problems is proposed. The notion of “efficient solution”
is defined and it is demonstrated, by means of an example, that a problem may have very many solutions which are efficient.
Next, potentially useful solution methods for multiobjective routing problems are discussed with emphasis being placed on
the use of shortest/k-shortest path techniques. Finally, some directions for possible further research are indicated.
Invited by B. Pelegrin 相似文献
72.
J. A. Cuesta-Albertos C. Matrán-Bea A. Tuero-Diaz 《Journal of Theoretical Probability》1996,9(2):263-283
We provide two families of lower bounds for theL
2-Wasserstein metric in separable Hilbert spaces which depend on the basis chosen for the space. Then we focus on one of these families and we provide a necessary and sufficient condition for the supremum in it to be attained. In the finite dimensional case, we identify the basis which provides the most accurate lower bound in the family.Research partially supported by the Spanish DGICYT under grants PB91-0306-02-00, 01 and 02. 相似文献
73.
74.
G. R. Bates 《Journal of Optimization Theory and Applications》1978,24(4):639-649
Lower closure theorems are proved for optimal control problems governed by ordinary differential equations for which the interval of definition may be unbounded. One theorem assumes that Cesari's property (Q) holds. Two theorems are proved which do not require property (Q), but assume either a generalized Lipschitz condition or a bound on the controls in an appropriateL
p-space. An example shows that these hypotheses can hold without property (Q) holding. 相似文献
75.
Michael Lauzon 《Journal of Functional Analysis》2004,212(2):500-512
In this paper we find a necessary and sufficient condition for two closed subspaces, and , of a Hilbert space to have a common complement, i.e. a subspace having trivial intersection with and and such that .Unlike the finite-dimensional case the condition is significantly more subtle than simple equalities of dimensions and codimensions, and non-trivial examples of subspaces without a common complement are possible. 相似文献
76.
N. X. Tan 《Journal of Optimization Theory and Applications》2004,123(3):619-638
Quasivariational inclusion problems are formulated and sufficient conditions on the existence of solutions are shown. As special cases, we obtain several results on the existence of solutions of general vector ideal, proper, Pareto, weak quasioptimization problems, quasivariational inequalities, and vector quasiequilibrium problems. Further, we prove theorems on the existence for solutions of systems of these inclusions. As a corollary, we obtain an ideal minimax theorem concerning vector functions. 相似文献
77.
Tomáš Tichý 《Operations Research Letters》2004,32(2):152-158
We consider a randomized on-line scheduling problem where each job has to be scheduled on any of m identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for m=3 processors must be strictly greater than . 相似文献
78.
JiongShengLI YongLiangPAN 《数学学报(英文版)》2004,20(5):803-806
We first apply non-negative matrix theory to the matrix K = D A, where D and A are the degree-diagonal and adjacency matrices of a graph G, respectively, to establish a relation on the largest Laplacian eigenvalue λ1 (G) of G and the spectral radius p(K) of K. And then by using this relation we present two upper bounds for λ1(G) and determine the extremal graphs which achieve the upper bounds. 相似文献
79.
In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k,
, determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog2n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n2log2n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances. 相似文献
80.
Marco?A.?BoschettiEmail author Aristide?Mingozzi 《4OR: A Quarterly Journal of Operations Research》2003,1(2):135-147
This paper is the second of a two part series and describes new lower and upper bounds for a more general version of the Two-Dimensional Finite Bin Packing Problem (2BP) than the one considered in Part I (see Boschetti and Mingozzi 2002). With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by
. This problem contains as special cases the oriented and non-oriented 2BP. The new lower bound is based on the one described in Part I for the oriented 2BP. The computational results on the test problems derived from the literature show the effectiveness of the new proposed lower and upper bounds. 相似文献