全文获取类型
收费全文 | 214篇 |
免费 | 2篇 |
专业分类
力学 | 1篇 |
数学 | 176篇 |
物理学 | 39篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 7篇 |
2014年 | 27篇 |
2013年 | 21篇 |
2012年 | 14篇 |
2011年 | 13篇 |
2010年 | 16篇 |
2009年 | 14篇 |
2008年 | 22篇 |
2007年 | 24篇 |
2006年 | 12篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1993年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1981年 | 2篇 |
排序方式: 共有216条查询结果,搜索用时 31 毫秒
51.
In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved, as our strategy, by redistributing traffic load from nodes with large betweenness centrality to nodes with small betweenness centrality in the proceeding of computing collective routing table. Particularly, depending on a parameter that controls the optimization scale, the new routing can not only enlarge traffic capacity of networks more, but also enhance traffic efficiency with smaller average path length. Comparing results of previous routing strategies, it is shown that the present improved routing performs more effectively. 相似文献
52.
Esa Hyytiä Aleksi PenttinenSamuli Aalto 《European Journal of Operational Research》2012,217(2):357-370
We consider the dispatching problem in a size- and state-aware multi-queue system with Poisson arrivals and queue-specific job sizes. By size- and state-awareness, we mean that the dispatcher knows the size of an arriving job and the remaining service times of the jobs in each queue. By queue-specific job sizes, we mean that the time to process a job may depend on the chosen server. We focus on minimizing the mean sojourn time (i.e., response time) by an MDP approach. First we derive the so-called size-aware relative values of states with respect to the sojourn time in an M/G/1 queue operating under FIFO, LIFO, SPT or SRPT disciplines. For FIFO and LIFO, the size-aware relative values turn out to be insensitive to the form of the job size distribution. The relative values are then exploited in developing efficient dispatching rules in the spirit of the first policy iteration. 相似文献
53.
54.
This paper presents a parallel tabu search algorithm that utilizes several different neighborhood structures for solving the capacitated vehicle routing problem. Single neighborhood or neighborhood combinations are encapsulated in tabu search threads and they cooperate through a solution pool for the purpose of exploiting their joint power. The computational experiments on 32 large scale benchmark instances show that the proposed method is highly effective and competitive, providing new best solutions to four instances while the average deviation of all best solutions found from the collective best results reported in the literature is about 0.22%. We are also able to associate the beneficial use of special neighborhoods with some test instance characteristics and uncover some sources of the collective power of multi-neighborhood cooperation. 相似文献
55.
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits
certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it
is capable of providing very strong lower bounds and, in most cases, optimal solutions.
Received: November 1998 / Accepted: September 2000?Published online March 22, 2001 相似文献
56.
This paper describes an exact algorithm for solving a problem where the same vehicle performs several routes to serve a set of customers with time windows. The motivation comes from the home delivery of perishable goods, where vehicle routes are short and must be combined to form a working day. A method based on an elementary shortest path algorithm with resource constraints is proposed to solve this problem. The method is divided into two phases: in the first phase, all non-dominated feasible routes are generated; in the second phase, some routes are selected and sequenced to form the vehicle workday. Computational results are reported on Euclidean problems derived from benchmark instances of the classical vehicle routing problem with time windows. 相似文献
57.
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomorphism between them. Intuitively, our results correspond to synthesizing alternative, more economical, interconnection networks by reducing the number of dimensions and/or link density of existing networks via mapping and pruning. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honeycomb meshes, including the derivation of provably correct shortest-path routing algorithms for such networks. 相似文献
58.
This article introduces a new exact algorithm for the capacitated vehicle routing problem with stochastic demands (CVRPSD). The CVRPSD can be formulated as a set partitioning problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme. Computational experiments show promising results. 相似文献
59.
The many-to-many location-routing problem 总被引:1,自引:0,他引:1
In this paper the many to many location routing problem is introduced, and its relationship to various problems in distribution
management is emphasised. Useful mathematical formulations which can be easily extended to cater for other related problems
are produced. Techniques for tackling this complex distribution problem are also outlined. 相似文献
60.
Nicolas Jozefowiez Fred Glover Manuel Laguna 《Journal of Mathematical Modelling and Algorithms》2008,7(2):177-195
We introduce and test a new approach for the bi-objective routing problem known as the traveling salesman problem with profits.
This problem deals with the optimization of two conflicting objectives: the minimization of the tour length and the maximization
of the collected profits. This problem has been studied in the form of a single objective problem, where either the two objectives
have been combined or one of the objectives has been treated as a constraint. The purpose of our study is to find solutions
to this problem using the notion of Pareto optimality, i.e. by searching for efficient solutions and constructing an efficient
frontier. We have developed an ejection chain local search and combined it with a multi-objective evolutionary algorithm which
is used to generate diversified starting solutions in the objective space. We apply our hybrid meta-heuristic to synthetic
data sets and demonstrate its effectiveness by comparing our results with a procedure that employs one of the best single-objective
approaches.
相似文献