abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

The biggest challenges faced in big cities are greenhouse gas emission and growing energy needs. Efficient utilization of existing infrastructures has a prominent role in response to the challenges. Energy hub approach embraces performance of different energy networks. Energy hub is defined as a super node in electrical system receiving distinctive energy carriers such as gas and electricity in...

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

Using covering problems (CoP) combined with binary search is a well-known and successful solution approach for solving continuous center problems. In this paper, we show that this is also true for center hub location problems in networks. We introduce and compare various formulations for hub covering problems (HCoP) and analyse the feasibility polyhedron of the most promising one. Computational...

This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can eficiently support lightpaths (connections) between nodes. Each lightpath follows a route in the network and must be assigned a channel along each link in its route. The load A , , , of a set of lightpath requests is the maximum over al l links of the number of lightpaths that ...

Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different trans...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

It has been claimed that proteins with more interacting partners (hubs) are structurally more disordered and have a slow evolutionary rate. Here, in this paper we analyzed the evolutionary rate and structural disorderness of human hub and non-hub proteins present/absent in protein complexes. We observed that both non-hub and hub proteins present in protein complexes, are characterized by high s...