全文获取类型
收费全文 | 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条查询结果,搜索用时 31 毫秒
51.
Nenad Mladenović Milan Dražić Vera Kovačevic-Vujčić Mirjana Čangalović 《European Journal of Operational Research》2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results. 相似文献
52.
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows 总被引:1,自引:0,他引:1
D. C. Paraskevopoulos P. P. Repoussis C. D. Tarantilis G. Ioannou G. P. Prastacos 《Journal of Heuristics》2008,14(5):425-455
This paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective
is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both
the total distance travelled by vehicles and the fixed vehicle costs, such that all problem’s constraints are satisfied. The
problem is solved using a two-phase solution framework based upon a hybridized Tabu Search, within a new Reactive Variable
Neighborhood Search metaheuristic algorithm. Computational experiments on benchmark data sets yield high quality solutions,
illustrating the effectiveness of the approach and its applicability to realistic routing problems.
This work is supported by the General Secretariat for Research and Technology of the Hellenic Ministry of Development under
contract GSRT NM-67. 相似文献
53.
The NP-hard problem of car sequencing appears as the heart of the logistic process of many car manufacturers. The subject of the ROADEF’2005 challenge addressed a car sequencing problem proposed by the car manufacturer RENAULT, more complex than the academic problem generally addressed in the literature. This paper describes two local search approaches for this problem. In the first part, a new approach by very large-scale neighborhood search is presented. This approach, designed during the qualification stage preceding the final, is based on an original integer linear programming formulation. The second part is dedicated to the approach which enabled us to win the ROADEF’2005 challenge. Inspired by the latest works on the subject, this one is based on very fast explorations of small neighborhoods. Our contribution here is mainly algorithmic, in particular by showing how much exploiting invariants speeds up the neighborhood evaluation and contributes to the diversification of the search. Finally, the two approaches are compared and discussed through an extensive computational study on RENAULT’s benchmarks. The main conclusion drawn at this point is that sophisticated metaheuristics are useless to solve car sequencing problems. More generally, our victory on ROADEF’2005 challenge demonstrates that algorithmic aspects, sometimes neglected, remain the key ingredients for designing and engineering high-performance local search heuristics. 相似文献
54.
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities 总被引:2,自引:0,他引:2
Michael Polacek Karl F. Doerner Richard F. Hartl Vittorio Maniezzo 《Journal of Heuristics》2008,14(5):405-423
The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications
like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of
the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length
restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the
basic problem as well as its extensions. The VNS shows excellent results on four different benchmark sets. Particularly, for
all 120 instances the best known solution could be found and in 71 cases a new best solution was achieved. 相似文献
55.
56.
For every d and k, we determine the smallest order of a vertex‐transitive graph of degree d and diameter k, and in each such case we show that this order is achieved by a Cayley graph. 相似文献
57.
A classification of connected vertex‐transitive cubic graphs of square‐free order is provided. It is shown that such graphs are well‐characterized metacirculants (including dihedrants, generalized Petersen graphs, Möbius bands), or Tutte's 8‐cage, or graphs arisen from simple groups PSL(2, p). 相似文献
58.
Consider a graph of minimum degree δ and order n. Its total vertex irregularity strength is the smallest integer k for which one can find a weighting such that for every pair of vertices of G. We prove that the total vertex irregularity strength of graphs with is bounded from above by . One of the cornerstones of the proof is a random ordering of the vertices generated by order statistics. 相似文献
59.
We prove that the regularity of a vertex operator superalgebra can be reduced to the semisimplicity of the category of its weak modules.Moreover,the rationality can be replaced by requiring that each 1/2Z+-graded module is a direct sum of irreducible weak modules. 相似文献
60.
Let G be a graph. The Hosoya index Z(G) of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs. 相似文献