全文获取类型
收费全文 | 1171篇 |
免费 | 6篇 |
国内免费 | 9篇 |
专业分类
化学 | 10篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 1131篇 |
物理学 | 30篇 |
出版年
2023年 | 10篇 |
2022年 | 10篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 4篇 |
2016年 | 11篇 |
2015年 | 12篇 |
2014年 | 46篇 |
2013年 | 54篇 |
2012年 | 109篇 |
2011年 | 46篇 |
2010年 | 55篇 |
2009年 | 88篇 |
2008年 | 93篇 |
2007年 | 80篇 |
2006年 | 60篇 |
2005年 | 24篇 |
2004年 | 22篇 |
2003年 | 14篇 |
2002年 | 20篇 |
2001年 | 19篇 |
2000年 | 17篇 |
1999年 | 11篇 |
1998年 | 20篇 |
1997年 | 10篇 |
1996年 | 18篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 15篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 22篇 |
1982年 | 28篇 |
1981年 | 16篇 |
1980年 | 30篇 |
1979年 | 20篇 |
1978年 | 31篇 |
1977年 | 10篇 |
1972年 | 2篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1186条查询结果,搜索用时 15 毫秒
1.
Optimization technologies and environmental applications 总被引:1,自引:0,他引:1
2.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献
3.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
4.
郭飞 《应用数学与计算数学学报》1997,11(1):19-26
Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。 相似文献
5.
M.V. Devyaterikova 《Operations Research Letters》2006,34(2):149-154
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed. 相似文献
6.
The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques. 相似文献
7.
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. 相似文献
8.
9.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献
10.
We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular,
we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject
to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first
to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed
arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of
this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality
on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action:
an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits
obtained from transmitting flows. 相似文献