نتایج جستجو برای: hub covering problem
تعداد نتایج: 938083 فیلتر نتایج به سال:
This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub mak...
Hubs are special centers that used for switching, transferring and handling freight or passengers in transportation systems. The hub location problem deals with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. Aiming at minimizing the total costs, maximizing utilization of transporters, maximizing the service level, etc....
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...
When the Seiberg-Witten curve of a four-dimensional N = 2 supersymmetric gauge theory wraps a Riemann surface as a multi-sheeted cover, a topological constraint requires that in general the curve should develop ramification points. We show that, while some of the branch points of the covering map can be identified with the punctures that appear in the work of Gaiotto, the ramification points gi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید