全文获取类型
收费全文 | 35004篇 |
免费 | 1103篇 |
国内免费 | 265篇 |
专业分类
化学 | 24665篇 |
晶体学 | 280篇 |
力学 | 684篇 |
综合类 | 1篇 |
数学 | 5960篇 |
物理学 | 4782篇 |
出版年
2023年 | 167篇 |
2022年 | 324篇 |
2021年 | 431篇 |
2020年 | 611篇 |
2019年 | 599篇 |
2018年 | 417篇 |
2017年 | 389篇 |
2016年 | 943篇 |
2015年 | 831篇 |
2014年 | 1005篇 |
2013年 | 1706篇 |
2012年 | 2180篇 |
2011年 | 2462篇 |
2010年 | 1329篇 |
2009年 | 1181篇 |
2008年 | 2274篇 |
2007年 | 2093篇 |
2006年 | 2117篇 |
2005年 | 1968篇 |
2004年 | 1687篇 |
2003年 | 1380篇 |
2002年 | 1335篇 |
2001年 | 486篇 |
2000年 | 469篇 |
1999年 | 408篇 |
1998年 | 397篇 |
1997年 | 418篇 |
1996年 | 449篇 |
1995年 | 314篇 |
1994年 | 368篇 |
1993年 | 335篇 |
1992年 | 303篇 |
1991年 | 278篇 |
1990年 | 244篇 |
1989年 | 210篇 |
1988年 | 210篇 |
1987年 | 221篇 |
1986年 | 180篇 |
1985年 | 376篇 |
1984年 | 331篇 |
1983年 | 280篇 |
1982年 | 342篇 |
1981年 | 277篇 |
1980年 | 288篇 |
1979年 | 240篇 |
1978年 | 227篇 |
1977年 | 217篇 |
1976年 | 208篇 |
1975年 | 186篇 |
1974年 | 160篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
32.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
33.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
34.
Maria G. Semenova Larisa E. Belyakova Anna S. Antipova Yu. N. Polikarpov Lida Klouda Anna Markovic Michael M. Il'in 《Colloids and surfaces. B, Biointerfaces》2003,31(1-4):47-54
We report on the effect of commercially important polysaccharides (maltodextrins with variable dextrose equivalent (Paselli SA-2, MD-6 and MD-10) on the surface activity at the air–water interface of small-molecule surfactants (sms), possessing different hydrophobic–lipophilic balance ((SSL (Na+), the main component is a sodium salt of stearol–lactoyl lactic acid, and PGE (080), polyglycerol ester of C18 fatty acid), and widely used in food products. A marked change of the surface activity of sms was found in the presence of maltodextrins by tensiometry. The combined data of laser multiangle light scattering and mixing calorimetry have suggested that this result is governed by specific complex formation between maltodextrins and sms in aqueous medium. Measurements have been made of the molar mass, the second virial coefficient and the enthalpy of intermolecular interactions in aqueous solutions. The implication of a degree of polymerization of maltodextrins in this phenomenon was shown. The interrelation between the molecular parameters of the formed complexes and their surface activity at the air–water interface has been revealed and discussed. 相似文献
35.
36.
37.
Michael B. Mensky 《General Relativity and Gravitation》2003,35(9):1729-1732
38.
39.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
40.