全文获取类型
收费全文 | 9075篇 |
免费 | 410篇 |
国内免费 | 379篇 |
专业分类
化学 | 408篇 |
晶体学 | 5篇 |
力学 | 394篇 |
综合类 | 102篇 |
数学 | 8394篇 |
物理学 | 561篇 |
出版年
2023年 | 43篇 |
2022年 | 88篇 |
2021年 | 94篇 |
2020年 | 106篇 |
2019年 | 118篇 |
2018年 | 132篇 |
2017年 | 171篇 |
2016年 | 184篇 |
2015年 | 131篇 |
2014年 | 378篇 |
2013年 | 489篇 |
2012年 | 510篇 |
2011年 | 399篇 |
2010年 | 393篇 |
2009年 | 554篇 |
2008年 | 578篇 |
2007年 | 629篇 |
2006年 | 457篇 |
2005年 | 387篇 |
2004年 | 312篇 |
2003年 | 329篇 |
2002年 | 302篇 |
2001年 | 268篇 |
2000年 | 272篇 |
1999年 | 233篇 |
1998年 | 206篇 |
1997年 | 189篇 |
1996年 | 213篇 |
1995年 | 186篇 |
1994年 | 136篇 |
1993年 | 141篇 |
1992年 | 140篇 |
1991年 | 134篇 |
1990年 | 103篇 |
1989年 | 71篇 |
1988年 | 94篇 |
1987年 | 54篇 |
1986年 | 84篇 |
1985年 | 119篇 |
1984年 | 80篇 |
1983年 | 23篇 |
1982年 | 55篇 |
1981年 | 44篇 |
1980年 | 35篇 |
1979年 | 31篇 |
1978年 | 51篇 |
1977年 | 49篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有9864条查询结果,搜索用时 0 毫秒
151.
El Houssaine Aghezzaf Thomas L. Magnanti Laurence A. Wolsey 《Mathematical Programming》1995,71(2):113-126
Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the rooted subtree problem, is to find a maximum weight subtree, with a specified root, from a given set of subtrees.The second problem, called the subtree packing problem, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root.We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by pasting together the convex hulls of the rooted subtree problems.We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk 4.Research supported in part by Nato Collaborative Research Grant CRG 900281, Science Program SC1-CT91-620 of the EEC, and contract No 26 of the programme Pôle d'attraction interuniversitaire of the Belgian government. 相似文献
152.
Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log3/2
n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%). 相似文献
153.
In this paper, we introduce a potential reduction method for harmonically convex programming. We show that, if the objective function and them constraint functions are allk-harmonically convex in the feasible set, then the number of iterations needed to find an -optimal solution is bounded by a polynomial inm, k, and log(1/). The method requires either the optimal objective value of the problem or an upper bound of the harmonic constantk as a working parameter. Moreover, we discuss the relation between the harmonic convexity condition used in this paper and some other convexity and smoothness conditions used in the literature.The authors like to thank Dr. Hans Nieuwenhuis for carefully reading this paper and the anonymous referees for the worthy suggestions. 相似文献
154.
Kojima's strong stability of stationary solutions can be characterized by means of first and second order terms. We treat the problem whether there is a characterization of the stability concept allowing perturbations of the objective function only, keeping the feasible set unchanged. If the feasible set is a convex polyhedron, then there exists a characterization which is in fact weaker than that one of strong stability. However, in general it appears that data of first and second order do not characterize that kind of stability. As an interpretation we have that the strong stability is the only concept of stability which both admits a characterization and works for large problem classes.Supported by the Deutsche Forschungsgemeinschaft, Graduiertenkolleg Analyse und Konstruktion in der Mathematik.Partial support under Support Center for Advanced Telecommunications Technology Research. 相似文献
155.
On invexity-type nonlinear programming problems 总被引:3,自引:0,他引:3
Z. K. Xu 《Journal of Optimization Theory and Applications》1994,80(1):135-148
In this paper, we propose a new class of nonlinear programing, called SFJ-invex programming. The optimality characterization shows that a problem is SFJ-invex if and only if a Fritz John point together with its multiplier, is a Fritz John saddle point of the problem. Under any constraint qualification assumption, a problem is SFJ-invex if and only if a Kuhn-Tucker point together with its multiplier is a Kuhn-Tucker saddle point of the problem. Furthermore, a generalization of the SFJ-invex, class is developed; the applications to (h, )-convex programming, particularly geometric programming, and to generalized fractional programming provide a relaxation in constraint qualification for differentiable problems to get saddle-point type optimality criteria.The author wishes to thank the referee for helpful comments. 相似文献
156.
The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory introduced recently by the first-named author is used to develop condition number bounds for conforming linear elements in two and three dimensions. The bounds are independent of arbitrary coefficient jumps between subdomains and of the number of subdomains, and grow only as the squared logarithm of the mesh size . Computational experiments for two- and three-dimensional problems confirm the theory.
157.
R. A. Poliquin R. T. Rockafellar 《Transactions of the American Mathematical Society》1996,348(5):1805-1838
The class of prox-regular functions covers all l.s.c., proper, convex functions, lower- functions and strongly amenable functions, hence a large core of functions of interest in variational analysis and optimization. The subgradient mappings associated with prox-regular functions have unusually rich properties, which are brought to light here through the study of the associated Moreau envelope functions and proximal mappings. Connections are made between second-order epi-derivatives of the functions and proto-derivatives of their subdifferentials. Conditions are identified under which the Moreau envelope functions are convex or strongly convex, even if the given functions are not.
158.
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. 相似文献
159.
In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171. 相似文献
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. 相似文献