全文获取类型
收费全文 | 10308篇 |
免费 | 744篇 |
国内免费 | 275篇 |
专业分类
化学 | 1433篇 |
晶体学 | 31篇 |
力学 | 1113篇 |
综合类 | 147篇 |
数学 | 6785篇 |
物理学 | 1818篇 |
出版年
2024年 | 23篇 |
2023年 | 108篇 |
2022年 | 338篇 |
2021年 | 346篇 |
2020年 | 226篇 |
2019年 | 239篇 |
2018年 | 246篇 |
2017年 | 340篇 |
2016年 | 325篇 |
2015年 | 244篇 |
2014年 | 496篇 |
2013年 | 585篇 |
2012年 | 623篇 |
2011年 | 514篇 |
2010年 | 471篇 |
2009年 | 583篇 |
2008年 | 579篇 |
2007年 | 637篇 |
2006年 | 512篇 |
2005年 | 438篇 |
2004年 | 350篇 |
2003年 | 322篇 |
2002年 | 297篇 |
2001年 | 272篇 |
2000年 | 266篇 |
1999年 | 204篇 |
1998年 | 218篇 |
1997年 | 202篇 |
1996年 | 143篇 |
1995年 | 160篇 |
1994年 | 137篇 |
1993年 | 117篇 |
1992年 | 102篇 |
1991年 | 89篇 |
1990年 | 82篇 |
1989年 | 61篇 |
1988年 | 49篇 |
1987年 | 41篇 |
1986年 | 39篇 |
1985年 | 54篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 21篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
Kenneth Sörensen 《Central European Journal of Operations Research》2006,14(2):193-207
In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often
or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in
use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total
travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this
distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a
given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small.
By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between
changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness
of the approach. 相似文献
942.
VICTOR P. GERGEL 《Journal of Global Optimization》1997,10(3):257-281
In this paper we propose a new multi-dimensional methodto solve unconstrained global optimization problems with Lipschitzianfirst derivatives. The method is based on apartition scheme that subdivides the search domain into a set of hypercubesin the course of optimization. This partitioning is regulated by thedecision rule that provides evaluation of the "importance"of each generated hypercube and selection of some partition element to performthe next iteration. Sufficient conditions of global convergence for the newmethod are investigated. Results of numerical experiments are alsopresented. 相似文献
943.
944.
945.
本文针对一类带有反凸约束的非线性比式和分式规划问题,提出一种求其全局最优解的单纯形分支和对偶定界算法.该算法利用Lagrange对偶理论将其中关键的定界问题转化为一系列易于求解的线性规划问题.收敛性分析和数值算例均表明提出的算法是可行的. 相似文献
946.
We provide a complexity classification of four variants of robust integer programming when the underlying Graver basis is given. We discuss applications to robust multicommodity flows and multiway statistical table problems, and describe an effective parametrization of robust integer programming. 相似文献
947.
Conjugate Gradient Methods with Armijo-type Line Searches 总被引:14,自引:0,他引:14
Yu-Hong DAIState Key Laboratory of Scientific Engineering Computing Institute of Computational Mathematics Academy of Mathematics System Sciences Chinese Academy of Sciences Beijing China 《应用数学学报(英文版)》2002,18(1):123-130
Abstract Two Armijo-type line searches are proposed in this paper for nonlinear conjugate gradient methods.Under these line searches, global convergence results are established for several famous conjugate gradientmethods, including the Fletcher-Reeves method, the Polak-Ribiere-Polyak method, and the conjugate descentmethod. 相似文献
948.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
949.
首先给出了牲畜(家禽)的传染病(禽流感、口蹄疫)的控制策略模型,控制措施包括两个方面:一,除掉那些已经被确诊的被传染的种群.二,对那些认为处于疫区的,可能被传染的种群采取预控制(隔离、提前宰杀).因为预控制并不能辨别出哪些群体是真正的接触者,所以这种控制措施将导致把感染者和健康的一并除掉,这就产生了一个矛盾:控制强度的加大能够减少疾病的传播率,但同时增加了无辜者被宰杀的群体的数量,并且证明了一个优化的控制策略,它能够减少由于过多捕杀带来的损失. 相似文献
950.