全文获取类型
收费全文 | 3127篇 |
免费 | 162篇 |
出版年
2023年 | 19篇 |
2021年 | 13篇 |
2020年 | 53篇 |
2019年 | 89篇 |
2018年 | 104篇 |
2017年 | 148篇 |
2016年 | 126篇 |
2015年 | 93篇 |
2014年 | 90篇 |
2013年 | 973篇 |
2012年 | 74篇 |
2011年 | 72篇 |
2010年 | 101篇 |
2009年 | 96篇 |
2008年 | 72篇 |
2007年 | 56篇 |
2006年 | 59篇 |
2005年 | 48篇 |
2004年 | 49篇 |
2003年 | 56篇 |
2002年 | 57篇 |
2001年 | 51篇 |
2000年 | 46篇 |
1999年 | 35篇 |
1998年 | 39篇 |
1997年 | 44篇 |
1996年 | 22篇 |
1995年 | 27篇 |
1994年 | 30篇 |
1993年 | 23篇 |
1992年 | 30篇 |
1991年 | 29篇 |
1990年 | 19篇 |
1989年 | 12篇 |
1988年 | 26篇 |
1987年 | 20篇 |
1986年 | 17篇 |
1985年 | 34篇 |
1984年 | 30篇 |
1983年 | 38篇 |
1982年 | 28篇 |
1981年 | 28篇 |
1980年 | 19篇 |
1979年 | 28篇 |
1978年 | 27篇 |
1977年 | 21篇 |
1976年 | 26篇 |
1975年 | 17篇 |
1974年 | 20篇 |
1973年 | 9篇 |
排序方式: 共有3289条查询结果,搜索用时 15 毫秒
21.
22.
The p-median problem is a powerful tool in analyzing facility location options when the goal of the location scheme is to minimize the average distance that demand must traverse to reach its nearest facility. It may be used to determine the number of facilities to site, as well as the actual facility locations. Demand data are frequently aggregated in p-median location problems to reduce the computational complexity of the problem. Demand data aggregation, however, results in the loss of locational information. This loss may lead to suboptimal facility location configurations (optimality errors) and inaccurate measures of the resulting travel distances (cost errors). Hillsman and Rhoda (1978) have identified three error components: Source A, B, and C errors, which may result from demand data aggregation. In this article, a method to measure weighted travel distances in p-median problems which eliminates Source A and B errors is proposed. Test problem results indicate that the proposed measurement scheme yields solutions with lower optimality and cost errors than does the traditional distance measurement scheme. 相似文献
23.
24.
David M. Mark 《Geographical analysis》1987,19(3):264-272
A new and recursive algorithm for determining proximal polygons is based on quadtree concepts. The algorithm can use any distance metric, and produces a quadtree of the image of the proximal polygons. This can be converted to vector form, or be incorporated directly into a quadtree-based geographic information system, in order to solve a number of closest-point problems. The algorithm can also produce the Delaunay triangulation, which is the dual of the proximal polygons. Empirically, the running time of the algorithm is proportional to the number of centers raised to the 1.6 power. 相似文献
25.
26.
27.
28.
29.
David Whynes 《Development and change》1991,22(3):475-496
This paper examines the feasibility of current policies of supply limitation as an instrument for the control of dangerous drugs (principally South American cocaine and Asian heroin). The structure of production and distribution is examined, and revenue estimates are made. A range of supply-side policy options are evaluated by means of a simple game-theory approach. In all cases, it is concluded that supply-side policies are likely to prove ineffectual as a means of drug control. 相似文献
30.