全文获取类型
收费全文 | 7841篇 |
免费 | 253篇 |
国内免费 | 159篇 |
专业分类
化学 | 435篇 |
晶体学 | 1篇 |
力学 | 226篇 |
综合类 | 92篇 |
数学 | 7207篇 |
物理学 | 292篇 |
出版年
2023年 | 36篇 |
2022年 | 73篇 |
2021年 | 89篇 |
2020年 | 94篇 |
2019年 | 102篇 |
2018年 | 107篇 |
2017年 | 138篇 |
2016年 | 132篇 |
2015年 | 109篇 |
2014年 | 316篇 |
2013年 | 378篇 |
2012年 | 422篇 |
2011年 | 314篇 |
2010年 | 327篇 |
2009年 | 469篇 |
2008年 | 486篇 |
2007年 | 524篇 |
2006年 | 345篇 |
2005年 | 321篇 |
2004年 | 241篇 |
2003年 | 239篇 |
2002年 | 246篇 |
2001年 | 218篇 |
2000年 | 230篇 |
1999年 | 183篇 |
1998年 | 167篇 |
1997年 | 149篇 |
1996年 | 183篇 |
1995年 | 169篇 |
1994年 | 124篇 |
1993年 | 131篇 |
1992年 | 134篇 |
1991年 | 119篇 |
1990年 | 97篇 |
1989年 | 72篇 |
1988年 | 91篇 |
1987年 | 59篇 |
1986年 | 88篇 |
1985年 | 113篇 |
1984年 | 77篇 |
1983年 | 25篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 38篇 |
1979年 | 29篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8253条查询结果,搜索用时 531 毫秒
141.
Rüdiger Schultz Leen Stougie Maarten H. van der Vlerk 《Mathematical Programming》1998,83(1-3):229-252
In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed. 相似文献
142.
Researchers first examined the problem of separable concave programming more than thirty years ago, making it one of the earliest branches of nonlinear programming to be explored. This paper proposes a new algorithm that finds the exact global minimum of this problem in a finite number of iterations. In addition to proving that our algorithm terminates finitely, the paper extends a guarantee of finiteness to all branch-and-bound algorithms for concave programming that (1) partition exhaustively using rectangular subdivisions and (2) branch on the incumbent solution when possible. The algorithm uses domain reduction techniques to accelerate convergence; it solves problems with as many as 100 nonlinear variables, 400 linear variables and 50 constraints in about five minutes on an IBM RS/6000 Power PC. An industrial application with 152 nonlinear variables, 593 linear variables, and 417 constraints is also solved in about ten minutes. 相似文献
143.
An efficient algorithm for solving nonlinear programs with noisy equality constraints is introduced and analyzed. The unknown exact constraints are replaced by surrogates based on the bundle idea, a well-known strategy from nonsmooth optimization. This concept allows us to perform a fast computation of the surrogates by solving simple quadratic optimization problems, control the memory needed by the algorithm, and prove the differentiability properties of the surrogate functions. The latter aspect allows us to invoke a sequential quadratic programming method. The overall algorithm is of the quasi-Newton type. Besides convergence theorems, qualification results are given and numerical test runs are discussed. 相似文献
144.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
145.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
146.
147.
关于E-凸函数及E-凸规划几个错误结论的修正 总被引:2,自引:0,他引:2
本文研究Youness在1999年建立的有关E凸函数和E规划的结论.利用E凸函数和E凸规划的基本性质和优化分析技术,获得了有关E凸函数E凸规划的几个错误结论的修正.. 相似文献
148.
Abdulaziz S. Alidi 《Applied Mathematical Modelling》1992,16(12):645-651
The improper handling and disposal of hazardous wastes cause threats to human health and the environment. One reason for the improper handling and disposal of these wastes is that not much consideration is usually given to the logistical aspects of hazardous waste systems. In this paper an integer goal programming model is developed that takes into consideration the multiple goals and needs of many groups involved in managing and planning hazardous waste systems. The model can easily be implemented and can be used to address many of the issues related to facility location, recycling, treatment, and disposal of hazardous wastes. 相似文献
149.
An interval-parameter fuzzy linear programming method (IFMOLP) is proposed in this study for multiple objective decision-making
under uncertainty. As a hybrid of interval-parameter and fuzzy methodologies, the IFMOLP incorporates interval-parameter linear
programming and fuzzy multiobjective programming approaches to form an integrated optimization system. The method inherits
advantages of interval-parameter programming, and allows uncertainties and decision-makers’ aspirations to be effectively
communicated into its programming processes and resulting solutions. Membership functions for both objectives and constraints
are formulated to reflect uncertainties in different system components and their interrelationships. An interactive solution
procedure has been developed based on solution approaches of the interval-parameter and fuzzy programming techniques, plus
necessary measures for handling the multiobjective feature. A didactic example is provided in the paper to illustrate the
detailed solution process. Possibilities of further improvements by seeking Pareto optimum and incorporating flexible preference
within constraints are also discussed. 相似文献
150.
针对重力输水管道设计中存在的问题,文章以管道造价最小为目标,应用动态规划,提出了一种新的重力输水管道优化设计方法,对输水管的当量管径、流量分配、连接管设置与可靠性校核计算等问题作了探讨。该方法可用于沿线有节点流量流出的并联输水管道优化设计,能明显节省投资,有良好的实用性 相似文献