全文获取类型
收费全文 | 3509篇 |
免费 | 85篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 90篇 |
2018年 | 51篇 |
2017年 | 80篇 |
2016年 | 78篇 |
2015年 | 68篇 |
2014年 | 74篇 |
2013年 | 746篇 |
2012年 | 46篇 |
2011年 | 49篇 |
2010年 | 56篇 |
2009年 | 47篇 |
2008年 | 69篇 |
2007年 | 59篇 |
2006年 | 45篇 |
2005年 | 43篇 |
2004年 | 57篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 48篇 |
1997年 | 49篇 |
1996年 | 61篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 64篇 |
1992年 | 61篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 70篇 |
1985年 | 66篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
排序方式: 共有3595条查询结果,搜索用时 15 毫秒
21.
This article concerns the location of a facility among n points where the points are serviced by “tours” taken from the facility. Tours include m points at a time and each group of m points may become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. For m ≤ 3, it is proved that the objective function is separable in each dimension and an exact solution method is given that involves finding the median of numbers appropriately generated from the problem data. It is shown that the objective function becomes multimodal when some tours pass through four or more points. A bounded heuristic procedure is suggested for this latter case. This heuristic involves solving an auxiliary three-point tour location problem. 相似文献
22.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
23.
This article is concerned with choosing a mix of weapons, subject to constraints, when the targets to be attacked are known imprecisely. It is shown that the correct method for optimizing the mix of weapons involves a pair of nested optimization problems (two-stage optimization). Two methods for optimizing the expected utility of a mix are discussed. The first involves a simultaneous attack model, in which it is implicitly assumed that all weapons are used at once. The second involves a sequential attack model, in which targets appear in random order and are attacked one at a time. Particular attention is given to the question of the appropriate mix of general-purpose and special-purpose weapons. 相似文献
24.
25.
26.
27.
28.
29.
30.