全文获取类型
收费全文 | 12429篇 |
免费 | 399篇 |
国内免费 | 481篇 |
专业分类
化学 | 437篇 |
晶体学 | 1篇 |
力学 | 232篇 |
综合类 | 80篇 |
数学 | 7027篇 |
物理学 | 311篇 |
综合类 | 5221篇 |
出版年
2024年 | 17篇 |
2023年 | 50篇 |
2022年 | 99篇 |
2021年 | 111篇 |
2020年 | 119篇 |
2019年 | 127篇 |
2018年 | 129篇 |
2017年 | 188篇 |
2016年 | 186篇 |
2015年 | 183篇 |
2014年 | 471篇 |
2013年 | 511篇 |
2012年 | 636篇 |
2011年 | 559篇 |
2010年 | 491篇 |
2009年 | 688篇 |
2008年 | 712篇 |
2007年 | 814篇 |
2006年 | 625篇 |
2005年 | 626篇 |
2004年 | 559篇 |
2003年 | 478篇 |
2002年 | 442篇 |
2001年 | 394篇 |
2000年 | 392篇 |
1999年 | 311篇 |
1998年 | 321篇 |
1997年 | 270篇 |
1996年 | 346篇 |
1995年 | 307篇 |
1994年 | 269篇 |
1993年 | 233篇 |
1992年 | 251篇 |
1991年 | 210篇 |
1990年 | 177篇 |
1989年 | 134篇 |
1988年 | 160篇 |
1987年 | 91篇 |
1986年 | 105篇 |
1985年 | 118篇 |
1984年 | 77篇 |
1983年 | 22篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems 总被引:2,自引:0,他引:2
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems.
We first present a brief review of MILP and MINLP for the case when these problems are modeled with algebraic equations and
inequalities. Since algebraic representations have some limitations such as difficulty of formulation and numerical singularities
for the nonlinear case, we consider logic-based modeling as an alternative approach, particularly Generalized Disjunctive
Programming (GDP), which the authors have extensively investigated over the last few years. Solution strategies for GDP models
are reviewed, including the continuous relaxation of the disjunctive constraints. Also, we briefly review a hybrid model that
integrates disjunctive programming and mixed-integer programming. Finally, the global optimization of nonconvex GDP problems
is discussed through a two-level branch and bound procedure. 相似文献
102.
王梅珍 《宁波大学学报(理工版)》2004,17(1):116-120
介绍了国外计算机图形学界对织物变形形态的研究现状.按建模原理分为几何方法。物理方法及综合方法. 相似文献
103.
A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval
of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval.
This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system.
Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.
Research supported by CONACyT of Mexico, Grant 130036.
Research partially supported by CONACyT of Mexico, Grant 44003. 相似文献
104.
Nicholas I. M. Gould Dominique Orban Annick Sartenaer Phillipe L. Toint 《4OR: A Quarterly Journal of Operations Research》2005,3(3):227-241
In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and
update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms
can easily be improved by choosing appropriate parameters. Recommended ranges of values for these parameters are exhibited
on the basis of extensive numerical tests.
MSC classification:
65K05, 90C26, 90C30 相似文献
105.
106.
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. 相似文献
107.
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. 相似文献
108.
在集值映射空间中引入了四种图象拓扑,给出它们之间的关系,并在点紧致连续映射空间上证明了其中两种拓扑之间的等价关系. 相似文献
109.
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. 相似文献
110.