全文获取类型
收费全文 | 9867篇 |
免费 | 737篇 |
国内免费 | 262篇 |
专业分类
化学 | 1328篇 |
晶体学 | 31篇 |
力学 | 1096篇 |
综合类 | 145篇 |
数学 | 6747篇 |
物理学 | 1519篇 |
出版年
2024年 | 22篇 |
2023年 | 103篇 |
2022年 | 334篇 |
2021年 | 335篇 |
2020年 | 207篇 |
2019年 | 223篇 |
2018年 | 243篇 |
2017年 | 327篇 |
2016年 | 309篇 |
2015年 | 228篇 |
2014年 | 460篇 |
2013年 | 551篇 |
2012年 | 618篇 |
2011年 | 472篇 |
2010年 | 447篇 |
2009年 | 558篇 |
2008年 | 555篇 |
2007年 | 611篇 |
2006年 | 488篇 |
2005年 | 423篇 |
2004年 | 337篇 |
2003年 | 312篇 |
2002年 | 287篇 |
2001年 | 263篇 |
2000年 | 264篇 |
1999年 | 195篇 |
1998年 | 212篇 |
1997年 | 193篇 |
1996年 | 135篇 |
1995年 | 161篇 |
1994年 | 133篇 |
1993年 | 112篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 49篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 54篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 24篇 |
1981年 | 22篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
151.
Frédéric Semet 《Annals of Operations Research》1995,61(1):45-65
In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems. 相似文献
152.
The local optimality conditions to polynomial optimization problems are a set of polynomial equations (plus some inequality conditions). With the recent techniques of Gröbner bases one can find all solutions to such systems, and hence also find global optima. We give a short survey of these methods. We also apply them to a set of problems termed with exact solutions unknown in the problem sets of Hock and Schittkowski. To these problems we give exact solutions. 相似文献
153.
Necessary conditions for a given pointx
0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f
1,...,f
m
),F:XR
m,XR
m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df
1(x
0)|i=1,...,m}T
*(X, x
0) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper. 相似文献
154.
In this paper we consider a class of systems described by singular integrodifferential equations. This type of systems appear, for example, in the modeling of certain aeroelastic control problems. We study these systems in frequency domain framework and show the existence of finite-dimensional stabilizing controllers. An algorithmic procedure is outlined for the construction of such controllers. In order to illustrate the numerical aspects of this algorithm, we present an example involving the classical Theodorsen model of an airfoil, which fits in the class of systems considered here.This work was supported in part by the National Science Foundation under Grants DMS-8907019 and MSS-9203418. 相似文献
155.
The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized. 相似文献
156.
We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ?2+logGK) logGM log (G? ?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ?3) times faster than the algorithm developed in the latter paper. 相似文献
157.
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. 相似文献
158.
We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research. 相似文献
159.
Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h
j
(x)g(x),j=1, ,m, xX}, wheref(·),h
j
(·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday. 相似文献
160.
A smooth method for the finite minimax problem 总被引:2,自引:0,他引:2
We consider unconstrained minimax problems where the objective function is the maximum of a finite number of smooth functions. We prove that, under usual assumptions, it is possible to construct a continuously differentiable function, whose minimizers yield the minimizers of the max function and the corresponding minimum values. On this basis, we can define implementable algorithms for the solution of the minimax problem, which are globally convergent at a superlinear convergence rate. Preliminary numerical results are reported.This research was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell'Università e della Ricerca Scientifica e Tecnologica, Italy. 相似文献