全文获取类型
收费全文 | 1293篇 |
免费 | 144篇 |
国内免费 | 14篇 |
专业分类
化学 | 5篇 |
力学 | 2篇 |
综合类 | 46篇 |
数学 | 1349篇 |
物理学 | 49篇 |
出版年
2023年 | 10篇 |
2022年 | 29篇 |
2021年 | 43篇 |
2020年 | 20篇 |
2019年 | 33篇 |
2018年 | 28篇 |
2017年 | 45篇 |
2016年 | 33篇 |
2015年 | 37篇 |
2014年 | 69篇 |
2013年 | 54篇 |
2012年 | 59篇 |
2011年 | 63篇 |
2010年 | 92篇 |
2009年 | 101篇 |
2008年 | 113篇 |
2007年 | 106篇 |
2006年 | 70篇 |
2005年 | 64篇 |
2004年 | 29篇 |
2003年 | 41篇 |
2002年 | 28篇 |
2001年 | 39篇 |
2000年 | 38篇 |
1999年 | 27篇 |
1998年 | 29篇 |
1997年 | 21篇 |
1996年 | 15篇 |
1995年 | 18篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 15篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有1451条查询结果,搜索用时 687 毫秒
71.
Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods. 相似文献
72.
Francis Sourd 《Journal of Heuristics》2001,7(6):519-531
Two approximation algorithms are presented for minimizing the makespan of independant tasks assigned on unrelated machines. The first one is based upon a partial and heuristical exploration of a search tree, which is used not only to build a solution but also to improve it thanks to a post-optimization procedure. The second implements a new large neighborhood improvement procedure to an already existing algorithm. Computational experiments show that their efficiency is equivalent to the best local search heuristics. 相似文献
73.
To improve the productivities of an automated container terminal, it is important to schedule different types of handling
equipment in an integrated way. A mixed-integer programming model, which considers various constraints related to the integrated
operations between different types of handling equipment, is formulated. A heuristic algorithm, called multi-layer genetic
algorithm (MLGA) is developed with a view to overcome the computation difficulty for solving the mathematical model. A numerical
experimentation is carried out in order to evaluate the performance of the algorithm. 相似文献
74.
Walter J. Gutjahr Stefan Katzensteiner Peter Reiter Christian Stummer Michaela Denk 《Central European Journal of Operations Research》2008,16(3):281-306
This paper presents a new model for project portfolio selection, paying specific attention to competence development. The
model seeks to maximize a weighted average of economic gains from projects and strategic gains from the increment of desirable
competencies. As a sub-problem, scheduling and staff assignment for a candidate set of selected projects must also be optimized.
We provide a nonlinear mixed-integer program formulation for the overall problem, and then propose heuristic solution techniques
composed of (1) a greedy heuristic for the scheduling and staff assignment part, and (2) two (alternative) metaheuristics
for the project selection part. The paper outlines experimental results on a real-world application provided by the E-Commerce
Competence Center Austria and, for a slightly simplified instance, presents comparisons with the exact solution computed by
CPLEX. 相似文献
75.
In this paper, we present a hybrid genetic algorithm for the well-known nurse scheduling problem (NSP). The NSP involves the
construction of roster schedules for nursing staff in order to maximize the quality of the roster schedule subject to various
hard constraints. In the literature, several genetic algorithms have been proposed to solve the NSP under various assumptions.
The contribution of this paper is twofold. First, we extensively compare the various crossover operators and test them on
a standard dataset in a solitary approach. Second, we propose several options to hybridize the various crossover operators. 相似文献
76.
Proactive heuristic procedures for robust project scheduling: An experimental analysis 总被引:1,自引:0,他引:1
Stijn Van de Vonder Erik DemeulemeesterWilly Herroelen 《European Journal of Operational Research》2008
Solution-robust project scheduling is a growing research field aiming at constructing proactive schedules to cope with multiple disruptions during project execution. When stochastic activity durations are considered, including time buffers between activities is a proven method to improve the stability of a baseline schedule. 相似文献
77.
This paper considers the problem of scheduling a given number of jobs on a single machine to minimize total earliness and tardiness when family setup times exist. The paper proposes optimal branch-and-bound algorithms for both the group technology assumption and if the group technology assumption is removed. A heuristic algorithm is proposed to solve larger problems with the group technology assumption removed. The proposed algorithms were empirically evaluated on problems of various sizes and parameters. The paper also explores how the choice of procedure affects total earliness and tardiness if an implementation of lean production methods has resulted in a reduction in setup times. An important finding of these empirical investigations is that scheduling jobs by removing the group technology assumption can significantly reduce total earliness and tardiness. 相似文献
78.
信息网络的传输宽带化和业务多样化需求给交换结构的可扩展性及性能提出了更高的要求.基于MSM(Memory-Space-Memory)输入输出排队交换结构进行研究,通过对交换网络内部拥塞调度机制进行深入分析,在保障调度公平性的基础上,提出一种严格匹配输出调度过程的SM-RR(Strict Matching algorithm based onRound-Robin)算法.与现有典型算法相比,该算法无需加速比即可获得较高的性能. 相似文献
79.
A survey of berth allocation and quay crane scheduling problems in container terminals 总被引:2,自引:0,他引:2
Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management. 相似文献
80.
Walter J. Gutjahr Stefan Katzensteiner Peter Reiter Christian Stummer Michaela Denk 《European Journal of Operational Research》2010
This paper develops a multi-objective optimization model for project portfolio selection taking employee competencies and their evolution into account. The objectives can include economic gains as well as gains expressed in terms of aggregated competence increments according to pre-defined profiles. In order to determine Pareto-optimal solutions, the overall problem is decomposed into a master problem addressing the portfolio selection itself, and a slave problem dealing with a suitable assignment of personnel to the work packages of the selected projects over time. We provide an asymptotic approximation of the problem by a linearized formulation, which allows an efficient and exact solution of the slave problem. For the solution of the master problem, we compare the multi-objective metaheuristics NSGA-II and P-ACO. Experimental results both for synthetically generated test instances and for real-world test instances, based on an application case from the E-Commerce Competence Center Austria, are presented. 相似文献