全文获取类型
收费全文 | 238篇 |
免费 | 29篇 |
国内免费 | 10篇 |
专业分类
化学 | 7篇 |
力学 | 4篇 |
综合类 | 10篇 |
数学 | 224篇 |
物理学 | 32篇 |
出版年
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 19篇 |
2013年 | 16篇 |
2012年 | 8篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 13篇 |
2008年 | 34篇 |
2007年 | 18篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 15篇 |
2001年 | 4篇 |
2000年 | 11篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1985年 | 3篇 |
1982年 | 2篇 |
排序方式: 共有277条查询结果,搜索用时 15 毫秒
91.
W. K. Min 《Acta Mathematica Hungarica》2008,121(3):283-292
We introduce and study the concepts of weak neighborhood systems, weak neighborhood spaces, ω(ψ, ψ′)-continuity, ω-continuity and ω*-continuity on WNS’s.
This work was supported by a grant from Research Institute for Basic Science at Kangwon National University. 相似文献
92.
Hichem Ben-El-Mechaiekh 《Journal of Fixed Point Theory and Applications》2008,4(2):177-182
A set-valued map defined on a compact lipschitzian retract of a normed space with nontrivial Euler characteristic and satisfying
(i) a strong graph approximation property and (ii) a tangency condition expressed in terms of Clarke’s tangent cone, admits
an equilibrium. This result extends in a simple way known solvability theorems to a large class of nonconvex set-valued maps
defined on nonsmooth domains.
Dedicated to Professor Felix Browder 相似文献
93.
Matrix symmetrization and several related problems have an extensive literature, with a recurring ambiguity regarding their complexity and relation to graph isomorphism. We present a short survey of these problems to clarify their status. In particular, we recall results from the literature showing that matrix symmetrization is in fact NP‐hard; furthermore, it is equivalent with the problem of recognizing whether a hypergraph can be realized as the neighborhood hypergraph of a graph. There are several variants of the latter problem corresponding to the concepts of open, closed, or mixed neighborhoods. While all these variants are NP‐hard in general, one of them restricted to the bipartite graphs is known to be equivalent with graph isomorphism. Extending this result, we consider several other variants of the bipartite neighborhood recognition problem and show that they all are either polynomial‐time solvable, or equivalent with graph isomorphism. Also, we study uniqueness of neighborhood realizations of hypergraphs and show that, in general, for all variants of the problem, a realization may be not unique. However, we prove uniqueness in two special cases: for the open and closed neighborhood hypergraphs of the bipartite graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 69–95, 2008 相似文献
94.
证明了,若G是一个p-阶3-连通无爪图,p≠10,11,15,并对G中任意两个不相邻的点u和v,满足|N(u)∪N(v)|≥(p-1)/2,则G是泛圈图. 相似文献
95.
Local and variable neighborhood search for the <Emphasis Type="Italic">k</Emphasis>-cardinality subgraph problem 总被引:1,自引:0,他引:1
The minimum weighted k-cardinality subgraph problem consists of finding a connected subgraph of a given graph with exactly k edges whose sum of weights is minimum. For this NP-hard combinatorial problem, only constructive types of heuristics have been suggested in the literature. In this paper we
propose a new heuristic based on variable neighborhood search metaheuristic rules. This procedure uses a new local search
developed by us. Extensive numerical results that include graphs with up to 5,000 vertices are reported. It appears that VNS
outperforms all previous methods. 相似文献
96.
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem 总被引:1,自引:0,他引:1
Karine Sinclair Jean-François Cordeau Gilbert Laporte 《European Journal of Operational Research》2014
Because most commercial passenger airlines operate on a hub-and-spoke network, small disturbances can cause major disruptions in their planned schedules and have a significant impact on their operational costs and performance. When a disturbance occurs, the airline often applies a recovery policy in order to quickly resume normal operations. We present in this paper a large neighborhood search heuristic to solve an integrated aircraft and passenger recovery problem. The problem consists of creating new aircraft routes and passenger itineraries to produce a feasible schedule during the recovery period. The method is based on an existing heuristic, developed in the context of the 2009 ROADEF Challenge, which alternates between three phases: construction, repair and improvement. We introduce a number of refinements in each phase so as to perform a more thorough search of the solution space. The resulting heuristic performs very well on the instances introduced for the challenge, obtaining the best known solution for 17 out of 22 instances within five minutes of computing time and 21 out of 22 instances within 10 minutes of computing time. 相似文献
97.
Due to an increasing demand for public transportation and intra-urban mobility, an efficient organization of public transportation has gained significant importance in the last decades. In this paper we present a model formulation for the bus rapid transit route design problem, given a fixed number of routes to be offered. The problem can be tackled using a decomposition strategy, where route design and the determination of frequencies and passenger flows will be dealt with separately. We propose a hybrid metaheuristic based on a combination of Large Neighborhood Search (LNS) and Linear Programming (LP). The algorithm as such is iterative. Decision upon the design of routes will be handled using LNS. The resulting passenger flows and frequencies will be determined by solving a LP. The solution obtained may then be used to guide the exploration of new route designs in the following iterations within LNS. Several problem specific operators are suggested and have been tested. The proposed algorithm compares extremely favorable and is able to obtain high quality solutions within short computational times. 相似文献
98.
We study a selective and periodic inventory routing problem (SPIRP) and develop an Adaptive Large Neighborhood Search (ALNS) algorithm for its solution. The problem concerns a biodiesel production facility collecting used vegetable oil from sources, such as restaurants, catering companies and hotels that produce waste vegetable oil in considerable amounts. The facility reuses the collected waste oil as raw material to produce biodiesel. It has to meet certain raw material requirements either from daily collection, or from its inventory, or by purchasing virgin oil. SPIRP involves decisions about which of the present source nodes to include in the collection program, and which periodic (weekly) routing schedule to repeat over an infinite planning horizon. The objective is to minimize the total collection, inventory and purchasing costs while meeting the raw material requirements and operational constraints. A single-commodity flow-based mixed integer linear programming (MILP) model was proposed for this problem in an earlier study. The model was solved with 25 source nodes on a 7-day cyclic planning horizon. In order to tackle larger instances, we develop an ALNS algorithm that is based on a rich neighborhood structure with 11 distinct moves tailored to this problem. We demonstrate the performance of the ALNS, and compare it with the MILP model on test instances containing up to 100 source nodes. 相似文献
99.
《数学学报》2014,(1)
<正>On Strong Kadison-Singer Algebras Ai Ju DONG Dong WANG Abstract We show that many Kadison-Singer algebras are maximal triangular in all algebras containing them although their definition requires the maximality taken in the class of reflexive algebras.Diagonal-trivial maximal non self-adjoint subalgebras of matrix algebras with lower dimensions are classified. 相似文献
100.