نتایج جستجو برای: distance to cities
تعداد نتایج: 10662026 فیلتر نتایج به سال:
As a result, policy too often ignored the significance of the spatial location of activities, or has responded to spatial issues – such as regional policy – by focusing on sectors, on individual firms, or on housing. This article will argue that one of the main reasons for the failure of past policies is the failure to recognise some of the fundamental features of the economy as it is located i...
"This paper examines the urban growth of 33 small and intermediate Korean cities during 1975-1980 from the ecological perspective. Using the multiple regression analysis, population growth of a city is measured by variables such as industrial structure, distance from a metropolitan city, and educational level of residents in a corresponding city. At the present development stage in Korea, tho...
Over the first half of the 19 century, the Prussian-German Customs Union known as the Zollverein gradually unified a scattered confederation of sovereign states under an internal free trade agreement. This paper uses grain prices to quantify the differential effect of the Zollverein for market integration among Zollverein members versus European powers that were not part of the Zollverein, incl...
nowadays urban sanitary landfill compatible with environmental principles and in line with sustainable development is a necessity. in this paper for the purpose of determining appropriate sanitary landfill sites in kohgilooye & boyerahmad province, , many data layers were used including: slope, land cover, distance to main roads, distance to cities & villages, geology, surface water network, di...
We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and can thus be solved by dynamic programming. Furthermore, we present a polynomial time algorithm that decides whether there exists a renumbering of the cities such that the resulting distance matrix becomes a relaxed Monge matrix.
We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and can thus be solved by dynamic programming. Furthermore, we present a polynomial time algorithm that decides whether there exists a renumbering of the cities such that the resulting distance matrix becomes a relaxed Monge matrix.
News articles capture a variety of topics about our society. They reflect not only the socioeconomic activities that happened in our physical world, but also some of the cultures, human interests, and public concerns that exist only in the perceptions of people. Cities are frequently mentioned in news articles, and two or more cities may co-occur in the same article. Such co-occurrence often su...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید