全文获取类型
收费全文 | 263篇 |
免费 | 2篇 |
国内免费 | 1篇 |
专业分类
化学 | 8篇 |
力学 | 16篇 |
数学 | 212篇 |
物理学 | 30篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 2篇 |
2015年 | 1篇 |
2014年 | 14篇 |
2013年 | 16篇 |
2012年 | 17篇 |
2011年 | 15篇 |
2010年 | 20篇 |
2009年 | 17篇 |
2008年 | 18篇 |
2007年 | 34篇 |
2006年 | 11篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 8篇 |
1997年 | 3篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
排序方式: 共有266条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
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. 相似文献
3.
Yaodong Cui 《Operations Research Letters》2006,34(6):630-638
This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found. 相似文献
4.
通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
《Operations Research Letters》2022,50(2):122-128
The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results. 相似文献
8.
9.
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. 相似文献
10.