全文获取类型
收费全文 | 1823篇 |
免费 | 113篇 |
国内免费 | 112篇 |
专业分类
化学 | 454篇 |
晶体学 | 29篇 |
力学 | 52篇 |
综合类 | 30篇 |
数学 | 1329篇 |
物理学 | 154篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 31篇 |
2021年 | 37篇 |
2020年 | 36篇 |
2019年 | 36篇 |
2018年 | 36篇 |
2017年 | 54篇 |
2016年 | 52篇 |
2015年 | 35篇 |
2014年 | 87篇 |
2013年 | 116篇 |
2012年 | 82篇 |
2011年 | 75篇 |
2010年 | 91篇 |
2009年 | 126篇 |
2008年 | 119篇 |
2007年 | 123篇 |
2006年 | 89篇 |
2005年 | 83篇 |
2004年 | 65篇 |
2003年 | 75篇 |
2002年 | 67篇 |
2001年 | 59篇 |
2000年 | 63篇 |
1999年 | 37篇 |
1998年 | 48篇 |
1997年 | 42篇 |
1996年 | 29篇 |
1995年 | 30篇 |
1994年 | 25篇 |
1993年 | 12篇 |
1992年 | 19篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 16篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 37篇 |
1984年 | 12篇 |
1983年 | 10篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2048条查询结果,搜索用时 15 毫秒
1.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
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.
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. 相似文献
4.
凹整数规划的分枝定界解法 总被引:3,自引:0,他引:3
凹整数规划是一类重要的非线性整数规划问题,也是在经济和管理中有着广泛应用的最优化问题.本文主要研究用分枝定界方法求解凹整数规划问题,这一方法的基本思想是对目标函数进行线性下逼近,然后用乘子搜索法求解连续松弛问题.数值结果表明,用这种分枝定界方法求解凹整数规划是有效的. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
YIN JIANXING 《高校应用数学学报(英文版)》1994,(4)
PACKINGPAIRSBYQUINTUPLES:THECASEOFZEROCONGRUENCEMOD4YINJIANXINGAbstract:LetD(v)denotethemaximumnumberofquintuplesofav-setofpo... 相似文献
8.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
9.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
10.
基于移动Agent技术的医学图像检索方法 总被引:1,自引:0,他引:1
针对现有医学图像检索方法中,检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题,设计并实现了一种基于移动Agent技术的医学图像检索方法,重点讨论了该方法实现的关键技术,包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法.模拟实验结果表明,该方法实时性较强,占用网络带宽较少,采用的算法运算速度提高近10倍、运算复杂度降低约50%,提取的纹理特征能充分表达图像内容,较好地满足了医学图像的检索要求,实现了对医学图像库快速较准确的检索. 相似文献