全文获取类型
收费全文 | 203篇 |
免费 | 0篇 |
国内免费 | 2篇 |
专业分类
化学 | 1篇 |
数学 | 203篇 |
物理学 | 1篇 |
出版年
2022年 | 1篇 |
2020年 | 1篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 9篇 |
2012年 | 4篇 |
2011年 | 10篇 |
2010年 | 6篇 |
2009年 | 8篇 |
2008年 | 17篇 |
2007年 | 14篇 |
2006年 | 15篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有205条查询结果,搜索用时 87 毫秒
121.
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly
on the original capacitated network and runs in O(mn(m +n logn) logn) time for the network withn nodes andm arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos’ (1993) dual network simplex algorithm by
a factor ofm/n. 相似文献
122.
A heuristic method is proposed for the solution of a large class of binary optimization problems, which includes weighted versions of the set covering, graph stability, partitioning, maximum satisfiability, and numerous other problems. The reported substantial computational experiments amply demonstrate the efficiency of the proposed method. 相似文献
123.
124.
Young-Seon Jeong Kyoung Seok Shin Myong K Jeong 《The Journal of the Operational Research Society》2015,66(4):529-538
Several meta-heuristic algorithms, such as evolutionary algorithms (EAs) and genetic algorithms (GAs), have been developed for solving feature selection problems due to their efficiency for searching feature subset spaces in feature selection problems. Recently, hybrid GAs have been proposed to improve the performance of conventional GAs by embedding a local search operation, or sequential forward floating search mutation, into the GA. Existing hybrid algorithms may damage individuals’ genetic information obtained from genetic operations during the local improvement procedure because of a sequential process of the mutation operation and the local improvement operation. Another issue with a local search operation used in the existing hybrid algorithms is its inappropriateness for large-scale problems. Therefore, we propose a novel approach for solving large-sized feature selection problems, namely, an EA with a partial sequential forward floating search mutation (EAwPS). The proposed approach integrates a local search technique, that is, the partial sequential forward floating search mutation into an EA method. Two algorithms, EAwPS-binary representation (EAwPS-BR) for medium-sized problems and EAwPS-integer representation (EAwPS-IR) for large-sized problems, have been developed. The adaptation of a local improvement method into the EA speeds up the search and directs the search into promising solution areas. We compare the performance of the proposed algorithms with other popular meta-heuristic algorithms using the medium- and large-sized data sets. Experimental results demonstrate that the proposed EAwPS extracts better features within reasonable computational times. 相似文献
125.
Erling D. Andersen 《Computational Optimization and Applications》2001,20(2):171-183
In general if a linear program has an optimal solution, then a primal and dual optimal solution is a certificate of the solvable status. Furthermore, it is well known that in the solvable case, then the linear program always has an optimal basic solution. Similarly, when a linear program is primal or dual infeasible then by Farkas's Lemma a certificate of the infeasible status exists. However, in the primal or dual infeasible case then there is not an uniform definition of what a suitable basis certificate of the infeasible status is.In this work we present a definition of a basis certificate and develop a strongly polynomial algorithm which given a Farkas type certificate of infeasibility computes a basis certificate of infeasibility. This result is relevant for the recently developed interior-point methods because they do not compute a basis certificate of infeasibility in general. However, our result demonstrates that a basis certificate can be obtained at a moderate computational cost. 相似文献
126.
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O*(2(1-(2/Δ))n). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O*(2mn/(m+n)). Both algorithms use polynomial space. 相似文献
127.
Sorin Alexe 《Discrete Applied Mathematics》2006,154(7):1050-1063
Sets of “positive” and “negative” points (observations) in n-dimensional discrete space given along with their non-negative integer multiplicities are analyzed from the perspective of the Logical Analysis of Data (LAD). A set of observations satisfying upper and/or lower bounds imposed on certain components is called a positive pattern if it contains some positive observations and no negative one. The number of variables on which such restrictions are imposed is called the degree of the pattern. A total polynomial algorithm is proposed for the enumeration of all patterns of limited degree, and special efficient variants of it for the enumeration of all patterns with certain “sign” and “coverage” requirements are presented and evaluated on a publicly available collection of benchmark datasets. 相似文献
128.
Hande Y. Benson Arun Sen David F. Shanno Robert J. Vanderbei 《Computational Optimization and Applications》2006,34(2):155-182
In this paper we consider the question of solving equilibrium problems—formulated as complementarity problems and, more generally,
mathematical programs with equilibrium constraints (MPECs)—as nonlinear programs, using an interior-point approach. These
problems pose theoretical difficulties for nonlinear solvers, including interior-point methods. We examine the use of penalty
methods to get around these difficulties and provide substantial numerical results. We go on to show that penalty methods
can resolve some problems that interior-point algorithms encounter in general.
An erratum to this article is available at . 相似文献
129.
Vadim V. Lozin 《Discrete Mathematics》2002,257(1):83-100
A skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 from the only vertex of degree three. In the present paper, we propose a structural characterization for the class of bipartite graphs containing no skew star as an induced subgraph and discuss some applications of the obtained result. 相似文献
130.
Uriel G. Rothblum 《Mathematical Programming》1992,54(1-3):57-67
The purpose of this paper is to extend a modified version of a recent result of Vande Vate (1989) which characterizes stable matchings as the extreme points of a certain polytope. Our proofs are simpler and more transparent than those of Vande Vate. 相似文献