全文获取类型
收费全文 | 7841篇 |
免费 | 253篇 |
国内免费 | 159篇 |
专业分类
化学 | 435篇 |
晶体学 | 1篇 |
力学 | 226篇 |
综合类 | 92篇 |
数学 | 7207篇 |
物理学 | 292篇 |
出版年
2023年 | 36篇 |
2022年 | 73篇 |
2021年 | 89篇 |
2020年 | 94篇 |
2019年 | 102篇 |
2018年 | 107篇 |
2017年 | 138篇 |
2016年 | 132篇 |
2015年 | 109篇 |
2014年 | 316篇 |
2013年 | 378篇 |
2012年 | 422篇 |
2011年 | 314篇 |
2010年 | 327篇 |
2009年 | 469篇 |
2008年 | 486篇 |
2007年 | 524篇 |
2006年 | 345篇 |
2005年 | 321篇 |
2004年 | 241篇 |
2003年 | 239篇 |
2002年 | 246篇 |
2001年 | 218篇 |
2000年 | 230篇 |
1999年 | 183篇 |
1998年 | 167篇 |
1997年 | 149篇 |
1996年 | 183篇 |
1995年 | 169篇 |
1994年 | 124篇 |
1993年 | 131篇 |
1992年 | 134篇 |
1991年 | 119篇 |
1990年 | 97篇 |
1989年 | 72篇 |
1988年 | 91篇 |
1987年 | 59篇 |
1986年 | 88篇 |
1985年 | 113篇 |
1984年 | 77篇 |
1983年 | 25篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 38篇 |
1979年 | 29篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8253条查询结果,搜索用时 832 毫秒
101.
对于线性型多目标半定规划问题,引进加权中心路径的概念,并利用单目标半定规划的中心路径法,提出了求解多目标半定规划问题的加权中心路径法,先得型对一个叔向量的有效解,然后在此基础上,提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法. 相似文献
102.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
103.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
104.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
105.
M. W. Warner 《Fuzzy Sets and Systems》1989,30(3):321-327
An amended proof of a theorem of Franklin's on sequentiality and sequential compactness is presented, and a corresponding fuzzy version formulated using the theory of quasi-coincidence. 相似文献
106.
C. R. Bector S. Chandra M. K. Bector 《Journal of Optimization Theory and Applications》1989,60(2):243-260
Using a parametric approach, duality is presented for a minimax fractional programming problem that involves several ratios in the objective function.The first author is thankful to Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319, and the authors are thankful to the anonymous referees for useful suggestions. 相似文献
107.
J. Fülöp 《Mathematical Methods of Operations Research》1991,35(1):1-13
This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.
Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.相似文献
108.
Stanislav Busygin 《Discrete Applied Mathematics》2006,154(15):2080-2096
A new simple generalization of the Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within this framework a trust region heuristic is developed. In contrast to usual trust region methods, it regards not only the global optimum of a quadratic objective over a sphere, but also a set of other stationary points of the program. We formulate and prove a condition when a Motzkin-Straus optimum coincides with such a point. The developed method has complexity O(n3), where n is the number of vertices of the graph. It was implemented in a publicly available software package QUALEX-MS.Computational experiments indicate that the algorithm is exact on small graphs and very efficient on the DIMACS benchmark graphs and various random maximum weight clique problem instances. 相似文献
109.
110.
We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times. 相似文献