全文获取类型
收费全文 | 429篇 |
免费 | 13篇 |
国内免费 | 31篇 |
专业分类
化学 | 62篇 |
晶体学 | 2篇 |
力学 | 81篇 |
综合类 | 5篇 |
数学 | 234篇 |
物理学 | 89篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 12篇 |
2021年 | 11篇 |
2020年 | 10篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 16篇 |
2015年 | 10篇 |
2014年 | 26篇 |
2013年 | 28篇 |
2012年 | 23篇 |
2011年 | 25篇 |
2010年 | 25篇 |
2009年 | 23篇 |
2008年 | 28篇 |
2007年 | 44篇 |
2006年 | 21篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 13篇 |
2002年 | 13篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 11篇 |
1997年 | 13篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
排序方式: 共有473条查询结果,搜索用时 0 毫秒
91.
adrian e. Scheidegger 《International Journal of Mathematical Education in Science & Technology》2013,44(6):765-772
A new type of generalization of fundamental calculating operations is attempted. Instead of generalizing the nature of the elements upon which operations are acting, the nature of the operations themselves is changed. By iterating the step which leads from addition to multiplication, new types of operations are generated. Some of these operations are discussed briefly. 相似文献
92.
The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. 相似文献
93.
94.
We will analyze mixed-0/1 second-order cone programs where the continuous and binary variables are solely coupled via the conic constraints. We devise a cutting-plane framework based on an implicit Sherali–Adams reformulation. The resulting cuts are very effective as symmetric solutions are automatically cut off and each equivalence class of 0/1 solutions is visited at most once. Further, we present computational results showing the effectiveness of our method and briefly sketch an application in optimal pooling of securities. 相似文献
95.
The Compartmentalised Knapsack Problem (CKP) is similar to the ordinary Knapsack Problem except that items to be packed belong to separate classes, and items can only be packed, in knapsack compartments, amongst items in their own class. This paper addresses a case study in the cutting of steel rolls in which the CKP arises. The rolls are cut in two-phases: the first phase produces sub-rolls (compartments) which are, after reducing the thickness, cut in a second phase to produce ribbons (a class consists of ordered items with the same thickness). Finally, two methods of solving CKP are presented, and these are used to generate columns in the classical linear optimisation model of Gilmore and Gomory. Results of computational experiments are presented. 相似文献
96.
In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm. 相似文献
97.
In a steel tube mill where an endless stream of steel tube is supplied from a manufacturing facility, trim waste is never made regardless of cutting patterns used and the standard cutting stock problem seems meaningless. Therefore, the continuous stock cutting problem with setup is introduced to minimize the sum of cutting time and pattern changing time to meet the given demand. We propose a new configuration of cutting machines to achieve higher production efficiency, namely the open-ended configuration as opposed to the traditional closed-ended configuration, thereby two variants of the problem are defined. We propose linear formulations for both problems using binary expansion of the number of pieces of different types in a pattern. Furthermore, we define the time for pattern change as a linear function of the number of knives used in the pattern to be more realistic. Computational studies suggest that the open-ended cutting machine may improve the production time by up to 44% and that our linear formulations are more efficient than the existing ones. 相似文献
98.
Juan Pablo Vielma 《Operations Research Letters》2007,35(1):29-35
Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel. 相似文献
99.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
100.
This paper proposes a two step algorithm for solving a large scale semi-definite logit model, which is appreciated as a powerful
model in failure discriminant analysis. This problem has been successfully solved by a cutting plane (outer approximation)
algorithm. However, it requires much more computation time than the corresponding linear logit model. A two step algorithm
to be proposed in this paper is intended to reduce the amount of computation time by eliminating a certain portion of the
data based on the information obtained by solving an associated linear logit model. It will be shown that this algorithm can
generate a solution with almost the same quality as the solution obtained by solving the original large scale semi-definite
model within a fraction of computation time. 相似文献