全文获取类型
收费全文 | 1888篇 |
免费 | 104篇 |
国内免费 | 143篇 |
专业分类
化学 | 89篇 |
力学 | 16篇 |
综合类 | 45篇 |
数学 | 1812篇 |
物理学 | 173篇 |
出版年
2023年 | 10篇 |
2022年 | 29篇 |
2021年 | 35篇 |
2020年 | 40篇 |
2019年 | 33篇 |
2018年 | 35篇 |
2017年 | 48篇 |
2016年 | 55篇 |
2015年 | 25篇 |
2014年 | 82篇 |
2013年 | 140篇 |
2012年 | 67篇 |
2011年 | 90篇 |
2010年 | 79篇 |
2009年 | 124篇 |
2008年 | 135篇 |
2007年 | 137篇 |
2006年 | 105篇 |
2005年 | 104篇 |
2004年 | 74篇 |
2003年 | 84篇 |
2002年 | 84篇 |
2001年 | 68篇 |
2000年 | 65篇 |
1999年 | 55篇 |
1998年 | 55篇 |
1997年 | 35篇 |
1996年 | 26篇 |
1995年 | 21篇 |
1994年 | 21篇 |
1993年 | 14篇 |
1992年 | 16篇 |
1991年 | 7篇 |
1990年 | 14篇 |
1989年 | 10篇 |
1988年 | 11篇 |
1987年 | 3篇 |
1986年 | 9篇 |
1985年 | 37篇 |
1984年 | 13篇 |
1983年 | 8篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 4篇 |
1975年 | 1篇 |
1970年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有2135条查询结果,搜索用时 0 毫秒
1.
2.
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. 相似文献
3.
4.
Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising. 相似文献
5.
姜德元 《浙江大学学报(理学版)》2003,30(5):499-502
研究了NA序列重对数律收敛速度的一般形式,把Davis和Gut的结果推广到了NA的情形,并使梁汉营等人关于对数律一个结果成为特例;作为推论,得到了关于NA序列重对数律收敛速度的充分条件. 相似文献
6.
凹整数规划的分枝定界解法 总被引:3,自引:0,他引:3
凹整数规划是一类重要的非线性整数规划问题,也是在经济和管理中有着广泛应用的最优化问题.本文主要研究用分枝定界方法求解凹整数规划问题,这一方法的基本思想是对目标函数进行线性下逼近,然后用乘子搜索法求解连续松弛问题.数值结果表明,用这种分枝定界方法求解凹整数规划是有效的. 相似文献
7.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
8.
Zvonko Čerin 《Central European Journal of Mathematics》2005,3(1):1-13
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products.
These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers. 相似文献
9.
Two Convergence Problems for Monotone Sequences 总被引:1,自引:0,他引:1
Eight measures of rate of convergence of monotone sequences of real numbers have been proposed and discussed in a paper by Beyer, Ebanks, and Qualls (Acta Appl. Math. 20 (1990), 267–284). These rates arose in discussions of dynamical systems. In the comparisons of these rates, two problems remained. A complete answer is given to one of the problems and a partial answer is given to the other problem. 相似文献
10.
Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. 相似文献