全文获取类型
收费全文 | 7228篇 |
免费 | 202篇 |
国内免费 | 126篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 214篇 |
综合类 | 66篇 |
数学 | 6921篇 |
物理学 | 185篇 |
出版年
2023年 | 25篇 |
2022年 | 64篇 |
2021年 | 72篇 |
2020年 | 72篇 |
2019年 | 84篇 |
2018年 | 90篇 |
2017年 | 122篇 |
2016年 | 113篇 |
2015年 | 95篇 |
2014年 | 298篇 |
2013年 | 321篇 |
2012年 | 394篇 |
2011年 | 284篇 |
2010年 | 298篇 |
2009年 | 442篇 |
2008年 | 458篇 |
2007年 | 495篇 |
2006年 | 317篇 |
2005年 | 292篇 |
2004年 | 221篇 |
2003年 | 216篇 |
2002年 | 223篇 |
2001年 | 196篇 |
2000年 | 215篇 |
1999年 | 173篇 |
1998年 | 147篇 |
1997年 | 139篇 |
1996年 | 173篇 |
1995年 | 163篇 |
1994年 | 114篇 |
1993年 | 125篇 |
1992年 | 124篇 |
1991年 | 115篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 107篇 |
1984年 | 75篇 |
1983年 | 21篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有7556条查询结果,搜索用时 15 毫秒
71.
We present an optimal piecewise-linear approximation method for the objective function of separable convex quadratic programs. The method provides guidelines on how many grid points to use and how to position them for a piecewise-linear approximation if the error induced by the approximation is to be bounded a priori.Corresponding author. 相似文献
72.
Svend-Holger Friis Ulrich Rieder Jürgen Weishaupt 《Mathematical Methods of Operations Research》1993,37(2):187-205
A general single-server queueing network model is considered. It is well-known that an optimal policy is determined by the largest-index policy. There is an index for each given queue and one allocates the server to a queue with largest current index. Using discounted dynamic programming we give a new and short proof of this result and derive some characterizations and bounds of the indices. Moreover, it is shown that an approximate largest-index policy yields an approximately optimal policy. These results lead to efficient methods for computing the indices. In particular, we present a general largest-remaining-index method. 相似文献
73.
This paper deals with a class of equilibria which are based on the use of memory strategies in the context of continuous-time stochastic differential games. In order to get interpretable results, we will focus the study on a stochastic differential game model of the exploitation of one species of fish by two competing fisheries. We explore the possibility of defining a so-called cooperative equilibrium, which will implement a fishing agreement. In order to obtain that equilibrium, one defines a monitoring variable and an associated retaliation scheme. Depending on the value of the monitoring variable, which provides some evidence of a deviation from the agreement, the probability increases that the mode of a game will change from a cooperative to a punitive one. Both the monitoring variable and the parameters of this jump process are design elements of the cooperative equilibrium. A cooperative equilibrium designed in this way is a solution concept for a switching diffusion game. We solve that game using the sufficient conditions for a feedback equilibrium which are given by a set of coupled HJB equations. A numerical analysis, approximating the solution of the HJB equations through an associated Markov game, enables us to show that there exist cooperative equilibria which dominate the classical feedback Nash equilibrium of the original diffusion game model.This research was supported by FNRS-Switzerland, NSERC-Canada, FCAR-Quebec. 相似文献
74.
We propose techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization and nonlinear programming problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain structure our techniques find not only the optimal solution value, but the solution as well. Our techniques lead to significant improvements in the theoretical running time compared with previously known methods (interior point methods, Ellipsoid algorithm, Vaidya's algorithm). We use our method to the solution of the LP relaxation and the Langrangean dual of several classical combinatorial problems, like the traveling salesman problem, the vehicle routing problem, the Steiner tree problem, thek-connected problem, multicommodity flows, network design problems, network flow problems with side constraints, facility location problems,K-polymatroid intersection, multiple item capacitated lot sizing problem, and stochastic programming. In all these problems our techniques significantly improve the theoretical running time and yield the fastest way to solve them. 相似文献
75.
District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming. 相似文献
76.
Adam?N.?LetchfordEmail author Andrea?Lodi 《4OR: A Quarterly Journal of Operations Research》2003,1(3):209-224
Given an integer polyhedron
, an integer point
, and a point
, the primal separation problem is the problem of finding a linear inequality which is valid for P
I
, violated by x
*, and satisfied at equality by
. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003, 相似文献
77.
残差绝对值之和最小准则下回归方程的求法 总被引:4,自引:0,他引:4
本应用线性规划方法,解决了“残差绝对值之和最小”,“最大偏差最小”准则下回归方程的求法,这种方法对于建立多元线性回归方程、多项式回归方程和可以线性化的回归方程都是有效的。 相似文献
78.
79.
概率约束随机规划的一种近似方法及其它的有效解模式 总被引:2,自引:0,他引:2
根据最小风险的投资最优问题,我们给出了一个统一的概率约束随机规划模型。随后我们提出了求解这类概率约束随机规划的一种近似算法,并在一定的条件下证明了算法的收敛性。此外,提出了这种具有概率约束多目标随机规划问题的一种有效解模型。 相似文献
80.
Nguyen V. Thoai 《Journal of Global Optimization》2000,18(4):321-336
The problem of optimizing some contiuous function over the efficient set of a multiple objective programming problem can be formulated as a nonconvex global optimization problem with special structure. Based on the conical branch and bound algorithm in global optimization, we establish an algorithm for optimizing over efficient sets and discuss about the implementation of this algorithm for some interesting special cases including the case of biobjective programming problems. 相似文献