全文获取类型
收费全文 | 13683篇 |
免费 | 1459篇 |
国内免费 | 389篇 |
专业分类
化学 | 1321篇 |
晶体学 | 31篇 |
力学 | 1099篇 |
综合类 | 145篇 |
数学 | 6717篇 |
物理学 | 1521篇 |
无线电 | 4697篇 |
出版年
2024年 | 61篇 |
2023年 | 233篇 |
2022年 | 429篇 |
2021年 | 480篇 |
2020年 | 401篇 |
2019年 | 391篇 |
2018年 | 387篇 |
2017年 | 514篇 |
2016年 | 556篇 |
2015年 | 488篇 |
2014年 | 837篇 |
2013年 | 842篇 |
2012年 | 971篇 |
2011年 | 819篇 |
2010年 | 638篇 |
2009年 | 754篇 |
2008年 | 775篇 |
2007年 | 808篇 |
2006年 | 659篇 |
2005年 | 586篇 |
2004年 | 436篇 |
2003年 | 411篇 |
2002年 | 370篇 |
2001年 | 331篇 |
2000年 | 301篇 |
1999年 | 227篇 |
1998年 | 251篇 |
1997年 | 209篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 143篇 |
1993年 | 127篇 |
1992年 | 107篇 |
1991年 | 90篇 |
1990年 | 76篇 |
1989年 | 64篇 |
1988年 | 50篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 56篇 |
1984年 | 50篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
This paper shows a computational method for optimizing the location of a store on a network in a competitive environment, assuming that consumers probabilistically choose stores following the Huff model (1963) and that the store can be located on a continuum of a network. This method gives the exact optimal solution with the computational order of n
N
2 logn
N
where n
N
is the number of nodes of the network. 相似文献
992.
993.
Qamrul Hasan Ansari Siegfried Schaible Jen-Chih Yao 《Journal of Global Optimization》2002,22(1-4):3-16
In this paper, we introduce the system of generalized vector equilibrium problems which includes as special cases the system of generalized implicit vector variational inequality problems, the system of generalized vector variational and variational-like inequality problems and the system of vector equilibrium problems. By using a maximal element theorem, we establish existence results for a solution of these systems. As an application, we derive existence results for a solution of a more general Nash equilibrium problem for vector-valued functions. 相似文献
994.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
995.
Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints 总被引:1,自引:0,他引:1
This paper addresses itself to a portfolio optimization problem under nonconvex transaction costs and minimal transaction unit constraints. Associated with portfolio construction is a fee for purchasing assets. Unit transaction fee is larger when the amount of transaction is smaller. Hence the transaction cost is usually a concave function up to certain point. When the amount of transaction increases, the unit price of assets increases due to illiquidity/market impact effects. Hence the transaction cost becomes convex beyond certain bound. Therefore, the net expected return becomes a general d.c. function (difference of two convex functions). We will propose a branch-and-bound algorithm for the resulting d.c. maximization problem subject to a constraint on the level of risk measured in terms of the absolute deviation of the rate of return of a portfolio. Also, we will show that the minimal transaction unit constraints can be incorporated without excessively increasing the amount of computation. 相似文献
996.
章栋恩 《数学的实践与认识》2002,32(5):774-777
Mathem atica软件 [1 ] 拥有符号运算、数值计算、和图形演示等广泛的数学计算功能 .本文用Mathematica解决了一个系统的优化设计问题 .通过对各容差搭配方案下目标值 y的方差估计和计算机随机模拟两种方法 ,得到了该系统的最优设计方案 .这两种方法也适用于一般的系统最优设计问题 相似文献
997.
1.引 言考虑下列等式约束最优化问题:min f(x)x∈Rn (1.1)s.t.C(x)=0其中f:Rn→R,C(x)=(c1(x),C2(x),…,Cm(x))T,Ci:Rn→R,(i=1,…,m).我们假设f(x),Ci(x)(i=1,2,…,m)是连续可微函数.令g(x)= f(x),A(x)= C(x)T.为了方便,我们通常用 Ck,fk,gk,Ak分别表示 C(xk),f(xk),g(xk)A(xk). SQP方法是一迭代方法.在 xk点,通过解下列子问题来得到搜索方向 dk 相似文献
998.
The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3. 相似文献
999.
An adaptive trust region method and its convergence 总被引:17,自引:0,他引:17
In this paper, a new trust region subproblem is proposed. The trust radius in the new subproblem adjusts itself adaptively.
As a result, an adaptive trust region method is constructed based on the new trust region subproblem. The local and global
convergence results of the adaptive trust region method are proved. Numerical results indicate that the new method is very
efficient. 相似文献
1000.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献