全文获取类型
收费全文 | 6893篇 |
免费 | 643篇 |
国内免费 | 529篇 |
专业分类
化学 | 364篇 |
晶体学 | 36篇 |
力学 | 418篇 |
综合类 | 70篇 |
数学 | 2234篇 |
物理学 | 1206篇 |
综合类 | 3737篇 |
出版年
2024年 | 21篇 |
2023年 | 65篇 |
2022年 | 101篇 |
2021年 | 142篇 |
2020年 | 100篇 |
2019年 | 159篇 |
2018年 | 150篇 |
2017年 | 195篇 |
2016年 | 172篇 |
2015年 | 209篇 |
2014年 | 360篇 |
2013年 | 551篇 |
2012年 | 374篇 |
2011年 | 432篇 |
2010年 | 347篇 |
2009年 | 463篇 |
2008年 | 398篇 |
2007年 | 559篇 |
2006年 | 471篇 |
2005年 | 396篇 |
2004年 | 337篇 |
2003年 | 362篇 |
2002年 | 279篇 |
2001年 | 241篇 |
2000年 | 190篇 |
1999年 | 145篇 |
1998年 | 130篇 |
1997年 | 122篇 |
1996年 | 109篇 |
1995年 | 84篇 |
1994年 | 64篇 |
1993年 | 52篇 |
1992年 | 62篇 |
1991年 | 47篇 |
1990年 | 41篇 |
1989年 | 32篇 |
1988年 | 28篇 |
1987年 | 24篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1957年 | 2篇 |
1936年 | 1篇 |
排序方式: 共有8065条查询结果,搜索用时 15 毫秒
31.
32.
33.
采用随机域外奇点法对轴拉杆件进行了分析.考虑杨氏模量的不确定性,得到了不同相关类型、不同相关长度下的解析解,并分析了相关类型、相关长度以及随机场中点离散法对位移方差的影响. 相似文献
34.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
35.
36.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
37.
38.
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows 总被引:2,自引:0,他引:2
Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central
depot to a set of geographically dispersed customers with known demands and predefined time windows. The problem is solved
by optimizing routes for the vehicles so as to meet all given constraints as well as to minimize the objectives of traveling
distance and number of vehicles. This paper proposes a hybrid multiobjective evolutionary algorithm (HMOEA) that incorporates
various heuristics for local exploitation in the evolutionary search and the concept of Pareto's optimality for solving multiobjective
optimization in VRPTW. The proposed HMOEA is featured with specialized genetic operators and variable-length chromosome representation
to accommodate the sequence-oriented optimization in VRPTW. Unlike existing VRPTW approaches that often aggregate multiple
criteria and constraints into a compromise function, the proposed HMOEA optimizes all routing constraints and objectives simultaneously,
which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence
trace. The HMOEA is applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances, which yields 20 routing solutions
better than or competitive as compared to the best solutions published in literature. 相似文献
39.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
40.
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. 相似文献