全文获取类型
收费全文 | 752篇 |
免费 | 69篇 |
国内免费 | 76篇 |
专业分类
化学 | 37篇 |
力学 | 20篇 |
综合类 | 19篇 |
数学 | 663篇 |
物理学 | 158篇 |
出版年
2024年 | 7篇 |
2023年 | 8篇 |
2022年 | 12篇 |
2021年 | 22篇 |
2020年 | 22篇 |
2019年 | 26篇 |
2018年 | 21篇 |
2017年 | 21篇 |
2016年 | 29篇 |
2015年 | 12篇 |
2014年 | 42篇 |
2013年 | 50篇 |
2012年 | 32篇 |
2011年 | 55篇 |
2010年 | 55篇 |
2009年 | 45篇 |
2008年 | 69篇 |
2007年 | 48篇 |
2006年 | 42篇 |
2005年 | 37篇 |
2004年 | 27篇 |
2003年 | 28篇 |
2002年 | 38篇 |
2001年 | 16篇 |
2000年 | 29篇 |
1999年 | 15篇 |
1998年 | 23篇 |
1997年 | 15篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1982年 | 3篇 |
1976年 | 4篇 |
排序方式: 共有897条查询结果,搜索用时 15 毫秒
41.
This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems. 相似文献
42.
A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. Burton and Sumner [Discrete Math. 306 (2006) 11-18] posed the problem: Is it true that for k?4, there exists a totally k-dot-critical graph with no critical vertices? In this paper, we show that this problem has a positive answer. 相似文献
43.
In this paper we continue the study of paired-domination in graphs introduced by Haynes and Slater (Networks 32 (1998), 199–206). A paired-dominating set of a graph G with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination
number of G, denoted by γ
pr(G), is the minimum cardinality of a paired-dominating set of G. The graph G is paired-domination vertex critical if for every vertex v of G that is not adjacent to a vertex of degree one, γ
pr(G − v) < γ
pr(G). We characterize the connected graphs with minimum degree one that are paired-domination vertex critical and we obtain sharp
bounds on their maximum diameter. We provide an example which shows that the maximum diameter of a paired-domination vertex
critical graph is at least 3/2 (γ
pr(G) − 2). For γ
pr(G) ⩽ 8, we show that this lower bound is precisely the maximum diameter of a paired-domination vertex critical graph.
The first author was supported in part by the South African National Research Foundation and the University of KwaZulu-Natal,
the second author was supported by the Natural Sciences and Engineering Research Council of Canada. 相似文献
44.
In this paper,two concepts of relative compactness-the relative strong fuzzy compactness and the relative ultra-fuzzy compactness are defined in L-topological spaces for an arbitrary L-set.Properties of relative strong fuzzy sets and relative ultra-fuzzy compact sets are studied in detail and some characteristic theorems are given.Some examples are illustrated. 相似文献
45.
Through modification of the delta values of the molecular connectivity indexes, and connecting the quantum chemistry with topology method effectively, the molecular connectivity indexes are converted into quantum-topology indexes. The modified indexes not only keep all information obtained from the original molecular connectivity method but also have their own virtue in application, and at the same time make up some disadvantages of the quantum and molecular connectivity methods. 相似文献
46.
Mirko Horňák 《Discrete Mathematics》2008,308(7):1268-1281
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ; from a result by Barth and Fournier it follows that Δ(T)?4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other. 相似文献
47.
The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0–1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances. 相似文献
48.
49.
徐新萍 《数学的实践与认识》2009,39(10)
设G是一个图,G的部分平方图G*满足V(G*)=V(G),E(G*)=E(G)∪{uv:uv■E(G),且J(u,v)≠■},这里J(u,v)={w∈N(u)∩N(v):N(w)■N[u]∪N[v]}.利用插点方法,证明了如下结果:设G是k-连通图(k2),b是整数,0min {k,(2b-1+k)/2}(n(Y)-1),则G是哈密尔顿图.同时给出图是1-哈密尔顿的和哈密尔顿连通的相关结果. 相似文献
50.
In this paper, we define a P-twisted affine Lie algebra, and construct its realizations by twisted vertex operators. 相似文献