全文获取类型
收费全文 | 12425篇 |
免费 | 404篇 |
国内免费 | 479篇 |
专业分类
化学 | 437篇 |
晶体学 | 1篇 |
力学 | 231篇 |
综合类 | 80篇 |
数学 | 7027篇 |
物理学 | 311篇 |
综合类 | 5221篇 |
出版年
2024年 | 16篇 |
2023年 | 50篇 |
2022年 | 99篇 |
2021年 | 111篇 |
2020年 | 119篇 |
2019年 | 127篇 |
2018年 | 129篇 |
2017年 | 188篇 |
2016年 | 186篇 |
2015年 | 183篇 |
2014年 | 471篇 |
2013年 | 511篇 |
2012年 | 636篇 |
2011年 | 559篇 |
2010年 | 491篇 |
2009年 | 688篇 |
2008年 | 712篇 |
2007年 | 814篇 |
2006年 | 625篇 |
2005年 | 626篇 |
2004年 | 559篇 |
2003年 | 478篇 |
2002年 | 442篇 |
2001年 | 394篇 |
2000年 | 392篇 |
1999年 | 311篇 |
1998年 | 321篇 |
1997年 | 270篇 |
1996年 | 346篇 |
1995年 | 307篇 |
1994年 | 269篇 |
1993年 | 233篇 |
1992年 | 251篇 |
1991年 | 210篇 |
1990年 | 177篇 |
1989年 | 134篇 |
1988年 | 160篇 |
1987年 | 91篇 |
1986年 | 105篇 |
1985年 | 118篇 |
1984年 | 77篇 |
1983年 | 22篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 19 毫秒
11.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
12.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
13.
Constraint Programming and Operations Research: Comments from an Operations Researcher 总被引:4,自引:0,他引:4
Michel Gendreau 《Journal of Heuristics》2002,8(1):19-24
This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research. 相似文献
14.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
15.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献
16.
非光滑非凸多目标规划解的充分条件 总被引:4,自引:0,他引:4
Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件. 相似文献
17.
This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
18.
Toward Fuzzy Optimization without Mathematical Ambiguity 总被引:15,自引:0,他引:15
Baoding Liu 《Fuzzy Optimization and Decision Making》2002,1(1):43-63
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed. 相似文献
19.
L. T. Ashchepkov 《Computational Mathematics and Mathematical Physics》2006,46(7):1168-1175
A general nonlinear programming problem with interval functions is considered. Two reductions of this problem to the deterministic nonlinear programming problem are proposed, and illustrative examples are discussed. 相似文献
20.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献