全文获取类型
收费全文 | 8962篇 |
免费 | 1125篇 |
国内免费 | 346篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 326篇 |
数学 | 5490篇 |
物理学 | 2818篇 |
出版年
2024年 | 22篇 |
2023年 | 91篇 |
2022年 | 298篇 |
2021年 | 269篇 |
2020年 | 189篇 |
2019年 | 205篇 |
2018年 | 226篇 |
2017年 | 341篇 |
2016年 | 445篇 |
2015年 | 295篇 |
2014年 | 545篇 |
2013年 | 602篇 |
2012年 | 488篇 |
2011年 | 544篇 |
2010年 | 430篇 |
2009年 | 571篇 |
2008年 | 586篇 |
2007年 | 596篇 |
2006年 | 480篇 |
2005年 | 433篇 |
2004年 | 374篇 |
2003年 | 316篇 |
2002年 | 296篇 |
2001年 | 254篇 |
2000年 | 226篇 |
1999年 | 195篇 |
1998年 | 182篇 |
1997年 | 158篇 |
1996年 | 135篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
线性规划的符号跟踪算法 总被引:2,自引:1,他引:1
分析了只含一个约束条件的线性规划最优基变量的特征,将其运用到搜寻含m个约束条件的线性规划的最优基变量,从而提出了线性规划的符号跟踪算法,为线性规划求解提供了新途径。 相似文献
52.
53.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
54.
55.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
56.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
57.
朱扬勇 《新疆大学学报(理工版)》1991,8(3):44-45
本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。 相似文献
58.
In this paper, we adapt the octahedral simplicial algorithm for solving systems of nonlinear equations to solve the linear complementarity problem with upper and lower bounds. The proposed algorithm generates a piecewise linear path from an arbitrarily chosen pointz
0 to a solution point. This path is followed by linear programming pivot steps in a system ofn linear equations, wheren is the size of the problem. The starting pointz
0 is left in the direction of one of the 2
n
vertices of the feasible region. The ray along whichz
0 is left depends on the sign pattern of the function value atz
0. The sign pattern of the linear function and the location of the points in comparison withz
0 completely govern the path of the algorithm.This research is part of the VF-Program Equilibrium and Disequilibrium in Demand and Supply, approved by the Netherlands Ministry of Education, Den Haag, The Netherlands. 相似文献
59.
A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence ofO(2), where is a small coupling parameter. In addition, only low-order systems are involved in algebrdic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.This work was supported by Rutgers University Research Council under Grant No. 2-02188. 相似文献
60.
Hiroshi Konno 《Mathematical Programming》1988,41(1-3):185-193
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n
4
m) algorithm for this class of problems. 相似文献