全文获取类型
收费全文 | 12138篇 |
免费 | 371篇 |
国内免费 | 434篇 |
专业分类
化学 | 204篇 |
晶体学 | 1篇 |
力学 | 255篇 |
综合类 | 71篇 |
数学 | 7068篇 |
物理学 | 315篇 |
综合类 | 5029篇 |
出版年
2024年 | 20篇 |
2023年 | 50篇 |
2022年 | 98篇 |
2021年 | 105篇 |
2020年 | 131篇 |
2019年 | 126篇 |
2018年 | 130篇 |
2017年 | 186篇 |
2016年 | 185篇 |
2015年 | 184篇 |
2014年 | 489篇 |
2013年 | 466篇 |
2012年 | 621篇 |
2011年 | 529篇 |
2010年 | 489篇 |
2009年 | 677篇 |
2008年 | 675篇 |
2007年 | 811篇 |
2006年 | 584篇 |
2005年 | 611篇 |
2004年 | 507篇 |
2003年 | 451篇 |
2002年 | 432篇 |
2001年 | 387篇 |
2000年 | 400篇 |
1999年 | 301篇 |
1998年 | 308篇 |
1997年 | 272篇 |
1996年 | 308篇 |
1995年 | 288篇 |
1994年 | 241篇 |
1993年 | 225篇 |
1992年 | 248篇 |
1991年 | 216篇 |
1990年 | 169篇 |
1989年 | 135篇 |
1988年 | 156篇 |
1987年 | 98篇 |
1986年 | 103篇 |
1985年 | 117篇 |
1984年 | 77篇 |
1983年 | 21篇 |
1982年 | 47篇 |
1981年 | 38篇 |
1980年 | 34篇 |
1979年 | 27篇 |
1978年 | 47篇 |
1977年 | 47篇 |
1976年 | 26篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
971.
组合同伦方法在无界域上的收敛性 总被引:3,自引:0,他引:3
组合同伦内点法由Feng等提出,是求解有界区域上的非凸数学规划的一种大范围收敛性方法,本文证明此算法适用于某些无界区域上的非凸数学规划问题。 相似文献
972.
Alexandre Dolgui Sergey Kovalev Mikhail Y. Kovalyov Sergey Malyutin Ameur Soukhal 《European Journal of Operational Research》2018,264(1):200-211
We study a paced assembly line intended for manufacturing different products. Workers with identical skills perform non-preemptable operations whose assignment to stations is known. Operations assigned to the same station are executed sequentially, and they should follow the given precedence relations. Operations assigned to different stations can be performed in parallel. The operation’s processing time depends on the number of workers performing this operation. The problem consists in assigning workers to operations such that the maximal number of workers employed simultaneously in the assembly line is minimized, the line cycle time is not exceeded and the box constraints specifying the possible number of workers for each operation are not violated. We show that the general problem is NP-hard in the strong sense, develop conventional and randomized heuristics, propose a reduction to a series of feasibility problems, present a MILP model for the feasibility problem, show relation of the feasibility problem to multi-mode project scheduling and multiprocessor scheduling, establish computational complexity of several special cases based on this relation and provide computer experiments with real and simulated data. 相似文献
973.
974.
975.
In this article, we consider bilevel optimization problems with discrete lower level and continuous upper level problems. Taking into account both approaches (optimistic and pessimistic) which have been developed in the literature to deal with this type of problem, we derive some conditions for the existence of solutions. In the case where the lower level is a parametric linear problem, the bilevel problem is transformed into a continuous one. After that, we are able to discuss local optimality conditions using tools of variational analysis for each of the different approaches. Finally, we consider a simple application of our results namely the bilevel programming problem with the minimum spanning tree problem in the lower level. 相似文献
976.
The authors prove a sufficient stochastic maximum principle for the optimal control of a forward-backward Markov regime switching jump diffusion system and show its connection to dynamic programming principle. The result is applied to a cash flow valuation problem with terminal wealth constraint in a financial market. An explicit optimal strategy is obtained in this example. 相似文献
977.
On the Global Convergence of a Projective Trust Region Algorithm for Nonlinear Equality Constrained Optimization 下载免费PDF全文
A trust-region sequential quadratic programming (SQP) method is developed and analyzed for the solution of smooth equality constrained optimization problems. The trust-region SQP algorithm is based on filter line search technique and a composite-step approach, which decomposes the overall step as sum of a vertical step and a horizontal step. The algorithm includes critical modifications of horizontal step computation. One orthogonal projective matrix of the Jacobian of constraint functions is employed in trust-region subproblems. The orthogonal projection gives the null space of the transposition of the Jacobian of the constraint function. Theoretical analysis shows that the new algorithm retains the global convergence to the first-order critical points under rather general conditions. The preliminary numerical results are reported. 相似文献
978.
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on how to deal with the resulting unconstrained maximization of the augmented Lagrangian are given. We further use the approximate maximum of the augmented Lagrangian with the aim of improving the convergence rate of alternating direction augmented Lagrangian frameworks. Numerical results are reported, showing the benefits of the approach. 相似文献
979.
针对多目标0-1规划问题,首先基于元胞自动机原理和人工狼群智能算法,提出一种元胞狼群优化算法,该算法将元胞机的演化规则与嚎叫信息素更新规则、人工狼群更新规则进行组合,采用元胞及其邻居来增强搜索过程的多样性和分布性,使人工头狼在元胞空间搜索的过程中,增强了人工狼群算法的全局搜索能力,并获得更多的全局非劣解;其次结合多目标0-1规划模型对元胞狼群算法进行了详细的数学描述,定义了人工狼群搜索空间、移动算子、元胞演化规则和非劣解集更新规则,并给出了元胞狼群算法的具体实现步骤;最后通过MATLAB软件对3个典型的多目标0-1规划问题算例进行解算,并将解算结果与其它人工智能算法的结果进行比较,结果表明:元胞狼群算法在多目标0-1规划问题求解方面可获得更多的非劣解集和更优的非劣解,并具有较快的收敛速度和较好的全局寻优能力。 相似文献
980.
基于供应链风险和供应链绩效的模糊性和供应商选择问题的动态性,本文考虑供应链风险和供应链绩效作为模糊变量,讨论如何给生产商一个满意的动态多目标供应商选择方案,确定供应链风险和总成本最小,以及供应链绩效最大。然后对该问题提出了一个动态多目标多产品供应商选择模型,该模型是首次同时考虑供应商选择,订单分配,供应链风险和供应链绩效的一个模糊动态非线性多目标规划模型。为了去模糊化和求解该模型,给出了一个风险和绩效的模糊评估法。最后给出一个数值算例验证了该模型的可行性,为决策者选择供应商提供了理论依据。 相似文献