نتایج جستجو برای: hub covering

تعداد نتایج: 65957  

Journal: :European Journal of Operational Research 2008
Sibel A. Alumur Bahar Yetis Kara

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hu...

2014
Jaehwan Lee Woojin Cho Kwan-Soo Lee

This paper presents a new method for optimizing the hub height of a wind turbine. In general, wind turbine energy production increases with the hub height, but so does the cost. Therefore, we must optimize the hub height. Here, we calculated the annual energy production using a wind probability function. This is a function of the hub height and the roughness, which is a surface characteristic. ...

2002
Morton E. O'Kelly

Hubs, or central trans-shipment facilities, allow the construction of a network where large numbers of direct connections can be replaced with fewer, indirect connections. Hub-andspoke configurations reduce and simplify network construction costs, centralize commodity handling and sorting, and allow carriers to take advantage of scale economies through consolidation of flows. Such networks have...

Journal: :Computers & OR 2009
Andreas T. Ernst Horst W. Hamacher Houyuan Jiang Mohan Krishnamoorthy Gerhard J. Woeginger

The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...

2014
Omar S. Saleh

In this paper, performance analysis of Shared and Switched Ethernet LANs under Different Scenarios through simulation has been attempted using OPNET as simulating tool. The first scenario was comes under Hub Only scenario. The environment of the network is in an office, which covers an area of 100m X 100m. The hub used is a 16 port hub in an Ethernet environment with the following configuration...

2017
Ellen W. S. Carbo Arjan Hillebrand Edwin van Dellen Prejaas Tewarie Philip C. de Witt Hamer Johannes C. Baayen Martin Klein Jeroen J. G. Geurts Jaap C. Reijneveld Cornelis J. Stam Linda Douw

Resective neurosurgery carries the risk of postoperative cognitive deterioration. The concept of 'hub (over)load', caused by (over)use of the most important brain regions, has been theoretically postulated in relation to symptomatology and neurological disease course, but lacks experimental confirmation. We investigated functional hub load and postsurgical cognitive deterioration in patients un...

2017
Borzou Rostami Nicolas Kämmerling Christoph Buchheim Uwe Clausen

The design of hub-and-spoke transport networks is a strategic planning problem, as the choice of hub locations has to remain unchanged for long time periods. However, strikes, disasters or traffic breakdown can lead to the unavailability of a hub for a short period of time. Therefore it is important to consider such events already in the planning phase, so that a proper reaction is possible; on...

Journal: :European Journal of Combinatorics 1991

Journal: :Electr. J. Comb. 2015
André G. Castoldi Emerson L. Monte Carmelo

We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...

Journal: :JoCG 2015
John C. Baez Karine Bagdasaryan Philip Gibbs

In 1914 Lebesgue defined a ‘universal covering’ to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by various mathematicians: Pál, Sprague and Hansen have each created a smaller universal covering by removing regions from those known before. However, Hansen’...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید