全文获取类型
收费全文 | 13421篇 |
免费 | 1941篇 |
国内免费 | 555篇 |
专业分类
化学 | 1954篇 |
晶体学 | 76篇 |
力学 | 1719篇 |
综合类 | 236篇 |
数学 | 7018篇 |
物理学 | 4914篇 |
出版年
2024年 | 38篇 |
2023年 | 130篇 |
2022年 | 364篇 |
2021年 | 440篇 |
2020年 | 310篇 |
2019年 | 323篇 |
2018年 | 345篇 |
2017年 | 477篇 |
2016年 | 484篇 |
2015年 | 392篇 |
2014年 | 780篇 |
2013年 | 804篇 |
2012年 | 869篇 |
2011年 | 756篇 |
2010年 | 665篇 |
2009年 | 785篇 |
2008年 | 805篇 |
2007年 | 851篇 |
2006年 | 740篇 |
2005年 | 653篇 |
2004年 | 507篇 |
2003年 | 478篇 |
2002年 | 435篇 |
2001年 | 429篇 |
2000年 | 389篇 |
1999年 | 307篇 |
1998年 | 312篇 |
1997年 | 282篇 |
1996年 | 221篇 |
1995年 | 231篇 |
1994年 | 188篇 |
1993年 | 143篇 |
1992年 | 139篇 |
1991年 | 131篇 |
1990年 | 98篇 |
1989年 | 79篇 |
1988年 | 67篇 |
1987年 | 60篇 |
1986年 | 50篇 |
1985年 | 62篇 |
1984年 | 61篇 |
1983年 | 19篇 |
1982年 | 29篇 |
1981年 | 31篇 |
1980年 | 25篇 |
1979年 | 34篇 |
1978年 | 22篇 |
1977年 | 32篇 |
1976年 | 18篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
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. 相似文献
52.
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. 相似文献
53.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
54.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
55.
56.
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. 相似文献
57.
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. 相似文献
58.
多级制造系统是现代制造业的主要加工方式,系统的每一级的加工速度和加工周期是系统设计的主要决策变量,正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型,它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等,并给出了一个应用实例。 相似文献
59.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
60.
ELSO is an environment for the solution oflarge-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partialseparability structure of the function to computethe gradient efficiently using automatic differentiation.We demonstrate ELSO's efficiency by comparing thevarious options available in ELSO.Our conclusion is that the hybrid option in ELSOprovides performance comparable to the hand-coded option, while having the significantadvantage of not requiring a hand-coded gradient orthe sparsity pattern of the partially separable function.In our test problems, which have carefully coded gradients,the computing time for the hybrid AD option is within a factor of two of thehand-coded option. 相似文献