全文获取类型
收费全文 | 10666篇 |
免费 | 286篇 |
国内免费 | 193篇 |
专业分类
化学 | 250篇 |
晶体学 | 1篇 |
力学 | 392篇 |
综合类 | 69篇 |
数学 | 9611篇 |
物理学 | 822篇 |
出版年
2023年 | 45篇 |
2022年 | 98篇 |
2021年 | 116篇 |
2020年 | 183篇 |
2019年 | 204篇 |
2018年 | 182篇 |
2017年 | 189篇 |
2016年 | 170篇 |
2015年 | 181篇 |
2014年 | 476篇 |
2013年 | 887篇 |
2012年 | 550篇 |
2011年 | 510篇 |
2010年 | 498篇 |
2009年 | 663篇 |
2008年 | 695篇 |
2007年 | 726篇 |
2006年 | 465篇 |
2005年 | 361篇 |
2004年 | 301篇 |
2003年 | 280篇 |
2002年 | 284篇 |
2001年 | 249篇 |
2000年 | 261篇 |
1999年 | 210篇 |
1998年 | 189篇 |
1997年 | 170篇 |
1996年 | 207篇 |
1995年 | 194篇 |
1994年 | 144篇 |
1993年 | 156篇 |
1992年 | 136篇 |
1991年 | 125篇 |
1990年 | 115篇 |
1989年 | 74篇 |
1988年 | 96篇 |
1987年 | 67篇 |
1986年 | 88篇 |
1985年 | 114篇 |
1984年 | 85篇 |
1983年 | 26篇 |
1982年 | 57篇 |
1981年 | 48篇 |
1980年 | 43篇 |
1979年 | 35篇 |
1978年 | 54篇 |
1977年 | 57篇 |
1976年 | 34篇 |
1975年 | 15篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
71.
G.J. Zalmai Qing-hong Zhang 《应用数学学报(英文版)》2007,23(2):217-234
In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem. 相似文献
72.
Vicky Mak 《Operations Research Letters》2007,35(1):36-44
This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions. 相似文献
73.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
74.
Bilevel programming approach applied to the flow shop scheduling problem under fuzziness 总被引:1,自引:0,他引:1
Samir A. Abass 《Computational Management Science》2005,2(4):279-293
This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered
here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision
makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to
minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan.
In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating
optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is
given.
Mathematics Subject Classification:
90C70, 90B36, 90C99 相似文献
75.
多目标半定规划的互补弱鞍点和G-鞍点最优性条件 总被引:1,自引:0,他引:1
对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题,给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义.然后,在较弱的凸性条件下,利用含矩阵和向量约束的择一性定理,建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件. 相似文献
76.
通过对非线性规划问题的K-T点的光滑路径跟踪方法研究,得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法,证明了光滑跟踪路径的存在性。 相似文献
77.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法 相似文献
78.
Xuyang Lou 《Journal of Mathematical Analysis and Applications》2007,328(1):316-326
In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities. 相似文献
79.
Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP)
problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new
algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination
with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria
are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate
the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of
randomly generated problems.
Work of the authors was partially supported by FCAR, MITACS and NSERC grants. 相似文献
80.
S. Al-Homidan 《Journal of Optimization Theory and Applications》2007,135(3):583-598
Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the
problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead
of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain
exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an
inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned
conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm. 相似文献