全文获取类型
收费全文 | 77654篇 |
免费 | 327篇 |
国内免费 | 374篇 |
专业分类
化学 | 23918篇 |
晶体学 | 789篇 |
力学 | 6719篇 |
数学 | 31927篇 |
物理学 | 15002篇 |
出版年
2018年 | 10433篇 |
2017年 | 10258篇 |
2016年 | 6051篇 |
2015年 | 833篇 |
2014年 | 286篇 |
2013年 | 296篇 |
2012年 | 3751篇 |
2011年 | 10472篇 |
2010年 | 5612篇 |
2009年 | 6024篇 |
2008年 | 6569篇 |
2007年 | 8730篇 |
2006年 | 199篇 |
2005年 | 1283篇 |
2004年 | 1509篇 |
2003年 | 1956篇 |
2002年 | 997篇 |
2001年 | 242篇 |
2000年 | 284篇 |
1999年 | 149篇 |
1998年 | 188篇 |
1997年 | 142篇 |
1996年 | 195篇 |
1995年 | 114篇 |
1994年 | 74篇 |
1993年 | 93篇 |
1992年 | 53篇 |
1991年 | 62篇 |
1990年 | 49篇 |
1989年 | 58篇 |
1988年 | 58篇 |
1987年 | 57篇 |
1986年 | 57篇 |
1985年 | 46篇 |
1984年 | 42篇 |
1983年 | 36篇 |
1982年 | 41篇 |
1981年 | 38篇 |
1980年 | 46篇 |
1979年 | 44篇 |
1978年 | 34篇 |
1973年 | 25篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1910年 | 24篇 |
1909年 | 41篇 |
1908年 | 40篇 |
1907年 | 32篇 |
1904年 | 28篇 |
排序方式: 共有10000条查询结果,搜索用时 24 毫秒
111.
New heuristics for over-constrained flight to gate assignments 总被引:1,自引:0,他引:1
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results. 相似文献
112.
W Y Hung S Kucherenko N J Samsatli N Shah 《The Journal of the Operational Research Society》2004,55(8):801-813
In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies. 相似文献
113.
In the data envelopment analysis (DEA) efficiency literature, qualitative characterizations of returns to scale (increasing, constant, or decreasing) are most common. In economics it is standard to use the scale elasticity as a quantification of scale properties for a production function representing efficient operations. Our contributions are to review DEA practices, apply the concept of scale elasticity from economic multi-output production theory to DEA piecewise linear frontier production functions, and develop formulas for scale elasticity for radial projections of inefficient observations in the relative interior of fully dimensional facets. The formulas are applied to both constructed and real data and show the differences between scale elasticities for the two valid projections (input and output orientations). Instead of getting qualitative measures of returns to scale only as was done earlier in the DEA literature, we now get a quantitative range of scale elasticity values providing more information to policy-makers. 相似文献
114.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献
115.
V E Krivonozhko O B Utkin A V Volodin I A Sablin M Patrin 《The Journal of the Operational Research Society》2004,55(10):1049-1058
The aim of the paper is to present and substantiate a technique to visualize DEA modelling results without any loss of mathematical rigour. The proposed family of parametric optimization methods allows one to construct an intersection of the multidimensional frontier with a two-dimensional plane determined by any pair of given directions. This approach reduces the efficiency analysis of production units to the investigation of well-known functions in economics. We also propose constructive methods to calculate marginal rates of substitution, marginal rates of transformation and so on. 相似文献
116.
117.
118.
Malmquist indexes can be used to estimate technical change over time. The index generally represents the average effect of technical change on all outputs in a multi-output firm. However, changes in technology do not necessarily affect all outputs involved in the analysis equally. In this paper, a method for estimating the effect of technical change on each of the different outputs is proposed. This estimation is done by a modification of quasi-Malmquist indexes. An artificial data set has been used to validate the method proposed in this paper. 相似文献
119.
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver. 相似文献
120.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献