全文获取类型
收费全文 | 46324篇 |
免费 | 1391篇 |
国内免费 | 2427篇 |
专业分类
化学 | 11666篇 |
晶体学 | 397篇 |
力学 | 891篇 |
综合类 | 101篇 |
数学 | 27347篇 |
物理学 | 9740篇 |
出版年
2023年 | 185篇 |
2022年 | 301篇 |
2021年 | 218篇 |
2020年 | 323篇 |
2019年 | 1091篇 |
2018年 | 962篇 |
2017年 | 667篇 |
2016年 | 467篇 |
2015年 | 486篇 |
2014年 | 941篇 |
2013年 | 2519篇 |
2012年 | 1179篇 |
2011年 | 2316篇 |
2010年 | 1816篇 |
2009年 | 2410篇 |
2008年 | 2851篇 |
2007年 | 2880篇 |
2006年 | 2354篇 |
2005年 | 1604篇 |
2004年 | 1868篇 |
2003年 | 1874篇 |
2002年 | 2219篇 |
2001年 | 2189篇 |
2000年 | 1964篇 |
1999年 | 2140篇 |
1998年 | 1860篇 |
1997年 | 1260篇 |
1996年 | 928篇 |
1995年 | 776篇 |
1994年 | 728篇 |
1993年 | 552篇 |
1992年 | 481篇 |
1991年 | 339篇 |
1990年 | 418篇 |
1989年 | 425篇 |
1988年 | 342篇 |
1987年 | 373篇 |
1986年 | 398篇 |
1985年 | 493篇 |
1984年 | 421篇 |
1983年 | 249篇 |
1982年 | 320篇 |
1981年 | 408篇 |
1980年 | 345篇 |
1979年 | 189篇 |
1978年 | 281篇 |
1977年 | 207篇 |
1976年 | 175篇 |
1975年 | 103篇 |
1974年 | 106篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
61.
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. 相似文献
62.
63.
64.
Kasper K. Berthelsen Jesper Møller 《Bulletin of the Brazilian Mathematical Society》2002,33(3):351-367
This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect
simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and
the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed.
Received: 30 June 2002 相似文献
65.
66.
We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of .
Received 24 March 2000. 相似文献
67.
J. Kalliongis 《Mathematische Zeitschrift》2002,241(4):801-828
For compact irreducible sufficiently large 3-manifolds containing 2-sided projective planes, we consider the following Realization
Problem: Given a finite subgroup of the outer automorphism group of the fundamental group, is there a finite group of homeomorphisms,
which induces this subgroup?
Received: 16 November 1999; in final form: 18 January 2001 / Published online: 8 November 2002 相似文献
68.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献
69.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
70.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献