全文获取类型
收费全文 | 238篇 |
免费 | 30篇 |
国内免费 | 10篇 |
专业分类
化学 | 7篇 |
力学 | 4篇 |
综合类 | 10篇 |
数学 | 225篇 |
物理学 | 32篇 |
出版年
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 19篇 |
2013年 | 16篇 |
2012年 | 9篇 |
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篇 |
排序方式: 共有278条查询结果,搜索用时 15 毫秒
1.
2.
3.
We introduce some relative versions of star selection principles first considered in [5], [11]. Some of the work extends results
from [4], [5] and gives some examples.
相似文献
4.
5.
6.
Roman Dwilewicz Joë l Merker 《Proceedings of the American Mathematical Society》2002,130(7):1975-1980
Let be a compact, connected, -smooth and globally minimal hypersurface in which divides the projective space into two connected parts and . We prove that there exists a side, or , such that every continuous CR function on extends holomorphically to this side. Our proof of this theorem is a simplification of a result originally due to F. Sarkis.
7.
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
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. 相似文献