全文获取类型
收费全文 | 10892篇 |
免费 | 797篇 |
国内免费 | 353篇 |
专业分类
化学 | 1734篇 |
晶体学 | 31篇 |
力学 | 1152篇 |
综合类 | 161篇 |
数学 | 7213篇 |
物理学 | 1751篇 |
出版年
2024年 | 22篇 |
2023年 | 116篇 |
2022年 | 369篇 |
2021年 | 351篇 |
2020年 | 239篇 |
2019年 | 257篇 |
2018年 | 273篇 |
2017年 | 362篇 |
2016年 | 334篇 |
2015年 | 245篇 |
2014年 | 480篇 |
2013年 | 615篇 |
2012年 | 668篇 |
2011年 | 527篇 |
2010年 | 494篇 |
2009年 | 610篇 |
2008年 | 620篇 |
2007年 | 678篇 |
2006年 | 537篇 |
2005年 | 477篇 |
2004年 | 382篇 |
2003年 | 360篇 |
2002年 | 328篇 |
2001年 | 296篇 |
2000年 | 288篇 |
1999年 | 225篇 |
1998年 | 238篇 |
1997年 | 221篇 |
1996年 | 155篇 |
1995年 | 176篇 |
1994年 | 142篇 |
1993年 | 122篇 |
1992年 | 111篇 |
1991年 | 92篇 |
1990年 | 83篇 |
1989年 | 67篇 |
1988年 | 53篇 |
1987年 | 47篇 |
1986年 | 47篇 |
1985年 | 56篇 |
1984年 | 52篇 |
1983年 | 17篇 |
1982年 | 30篇 |
1981年 | 25篇 |
1980年 | 19篇 |
1979年 | 32篇 |
1978年 | 21篇 |
1977年 | 30篇 |
1976年 | 20篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
22.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
23.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
24.
Gabriele Bonanno 《Journal of Global Optimization》1998,12(1):101-104
In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended. 相似文献
25.
Arno Jüschke Johannes Jahn Andreas Kirsch 《Computational Optimization and Applications》1997,7(3):261-276
In this paper we consider a special optimization problem withtwo objectives which arises in antenna theory. It is shown that thisabstract bicriterial optimization problem has at least one solution.Discretized versions of this problem are also discussed, and therelationships between these finite dimensional problems and the infinitedimensional problem are investigated. Moreover, we presentnumerical results for special parameters using a multiobjectiveoptimization method. 相似文献
26.
多级制造系统是现代制造业的主要加工方式,系统的每一级的加工速度和加工周期是系统设计的主要决策变量,正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型,它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等,并给出了一个应用实例。 相似文献
27.
In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here). 相似文献
28.
N. H. Al-Assady 《Journal of Optimization Theory and Applications》1997,94(3):747-755
We present a method which generates conjugate search directions and maintains the quadratic convergence property, when applied to a quadratic function, even when the line searches are not exact. The method is similar to that given by Dixon, but needs one less vector store. When the method is applied to a number of general functions of different dimensionality, results show the efficiency of the method. 相似文献
29.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
30.
Wei Wang Li-Ping Pang Zun-Quan Xia 《应用数学学报(英文版)》2007,23(1):29-38
In this paper,the UV-theory and P-differential calculus are employed to study second-order ex-pansion of a class of D.C.functions and minimization problems.Under certain conditions,some properties ofthe U-Lagrangian,the second-order expansion of this class of functions along some trajectories are formulated.Some first and second order optimality conditions for the class of D.C.optimization problems are given. 相似文献