全文获取类型
收费全文 | 1975篇 |
免费 | 130篇 |
国内免费 | 73篇 |
专业分类
化学 | 348篇 |
晶体学 | 4篇 |
力学 | 104篇 |
综合类 | 25篇 |
数学 | 1254篇 |
物理学 | 443篇 |
出版年
2024年 | 3篇 |
2023年 | 25篇 |
2022年 | 46篇 |
2021年 | 39篇 |
2020年 | 41篇 |
2019年 | 41篇 |
2018年 | 60篇 |
2017年 | 54篇 |
2016年 | 53篇 |
2015年 | 42篇 |
2014年 | 108篇 |
2013年 | 148篇 |
2012年 | 109篇 |
2011年 | 118篇 |
2010年 | 97篇 |
2009年 | 144篇 |
2008年 | 126篇 |
2007年 | 165篇 |
2006年 | 97篇 |
2005年 | 85篇 |
2004年 | 72篇 |
2003年 | 85篇 |
2002年 | 54篇 |
2001年 | 39篇 |
2000年 | 43篇 |
1999年 | 34篇 |
1998年 | 36篇 |
1997年 | 26篇 |
1996年 | 30篇 |
1995年 | 9篇 |
1994年 | 22篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 12篇 |
1985年 | 17篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有2178条查询结果,搜索用时 22 毫秒
1.
本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较. 相似文献
2.
3.
4.
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics. 相似文献
5.
6.
7.
Marco Lehmann-Waffenschmidt 《Central European Journal of Operations Research》2006,14(3):289-298
It is routine to demonstrate in the exchange economy framework that small changes of individual preferences and endowments always result in small changes of the derived excess demand functions as one should expect. Though being as desirable for reasons of the consistency of the whole approach, however, a precise proof of the converse direction so far is still open to question. The present paper shows that it is actually true. We use a decomposition method for aggregate excess demand functions developed by Mas-Colell which is derived from the well-known decomposition method developed by Sonnenschein and perfected by Debreu and Mantel. Our result fills in a notorious gap in the line of economic justification usually given for this decomposition, or disaggregation, method in that comparative static analysis would be restricted if the decomposition of excess demand functions would not be continuous. 相似文献
8.
9.
10.
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results. 相似文献