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

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

2014
Belma Yelbay Kerem Bülbül

The minimum hub cover is a new NP-hard optimization problem that has been recently introduced to the literature in the context of graph query processing. Although a standard set covering formulation has been given, alternate models have not been studied before. This paper fills in that gap and proposes several new mathematical programming models. We give two binary integer programming formulati...

2004
Vladimir Marianov Daniel Serra

We o er a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the tra c that goes from the speci ed origin to the speci ed destination. The formulation presented here reduces the number of variables and constraints as co...

Journal: :Computers & OR 2009
Hatice Calik Sibel A. Alumur Bahar Yetis Kara Oya Ekin Karasan

Available online 24 December 2008

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

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