全文获取类型
收费全文 | 13055篇 |
免费 | 800篇 |
国内免费 | 482篇 |
专业分类
化学 | 2517篇 |
晶体学 | 36篇 |
力学 | 1672篇 |
综合类 | 148篇 |
数学 | 7650篇 |
物理学 | 2314篇 |
出版年
2024年 | 19篇 |
2023年 | 187篇 |
2022年 | 307篇 |
2021年 | 373篇 |
2020年 | 287篇 |
2019年 | 270篇 |
2018年 | 282篇 |
2017年 | 426篇 |
2016年 | 414篇 |
2015年 | 308篇 |
2014年 | 643篇 |
2013年 | 797篇 |
2012年 | 772篇 |
2011年 | 679篇 |
2010年 | 600篇 |
2009年 | 820篇 |
2008年 | 819篇 |
2007年 | 844篇 |
2006年 | 659篇 |
2005年 | 582篇 |
2004年 | 469篇 |
2003年 | 427篇 |
2002年 | 393篇 |
2001年 | 335篇 |
2000年 | 339篇 |
1999年 | 251篇 |
1998年 | 258篇 |
1997年 | 234篇 |
1996年 | 166篇 |
1995年 | 191篇 |
1994年 | 167篇 |
1993年 | 130篇 |
1992年 | 126篇 |
1991年 | 101篇 |
1990年 | 81篇 |
1989年 | 74篇 |
1988年 | 66篇 |
1987年 | 47篇 |
1986年 | 48篇 |
1985年 | 63篇 |
1984年 | 59篇 |
1983年 | 19篇 |
1982年 | 30篇 |
1981年 | 24篇 |
1980年 | 22篇 |
1979年 | 38篇 |
1978年 | 22篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献
122.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献
123.
Ivan Nunes da Silva Wagner Caradori do AmaralLucia Valeria de Arruda 《Applied Mathematical Modelling》2007
This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network. 相似文献
124.
125.
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. 相似文献
126.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
127.
安全质量费用工期在网络计划中的系统优化研究 总被引:1,自引:0,他引:1
施工网络计划中安全、质量、费用、工期达到综合优化是工程管理决策追求的目标,在工程项目管理中对这4个指标进行全面系统分析,并且进行综合均衡优化,对于提高工程项目的综合效益至关重要.采取在网络计划所有可行的施工方案中寻求最优的方案组合,从而达到总目标的优化.并且通过一个实例来说明本方法的应用. 相似文献
128.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
129.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
130.
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. 相似文献