相关论文: Upgrading nodes in tree-shaped hub location

In this paper we propose an extension of the Uncapacitated Hub Location Problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We…

This paper introduces the Hub Location Problem under Link Failures, a hub location problem in which activated inter-hub links may fail with a given probability. Two different optimization models are studied, which construct hub backbone…

We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of the network) so as to maximise coverage, considering that the…

In this paper, we propose the Ordered Median Tree Location Problem (OMT). The OMT is a single-allocation facility location problem where p facilities must be placed on a network connected by a non-directed tree. The objective is to minimize…

This paper introduces a new formulation and solution framework for hub location problems. The formulation is based on 2-index aggregated flow variables and incorporates a set of aggregated demand constraints, which are novel in hub…

We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find…

This paper introduces the Bilevel Tree-of-Hubs Location Problem with Prices (BTHLPwP). The BTHLPwP is a multiple-allocation hub location problem in which, in addition to determining the nodes and links of a tree-shaped hub backbone network,…

Network interdiction problems by deleting critical nodes have wide applications. However, node deletion is not always feasible in certain practical scenarios. We consider the maximum shortest path interdiction problem by upgrading nodes on…

In this paper we study the problem of locating a given number of hyperplanes minimizing an objective function of the closest distances from a set of points. We propose a general framework for the problem in which norm-based distances…

Increasing the connectivity of a graph is a pivotal challenge in robust network design. The weighted connectivity augmentation problem is a common version of the problem that takes link costs into consideration. The problem is then to find…

In this paper, we introduce the Fixed Topology Minimum-Length Tree with Neighborhood Problem, which aims to embed a rooted tree-shaped graph into a $d$-dimensional metric space while minimizing its total length provided that the nodes must…

The paper addresses design/building frameworks for some kinds of tree-like and hierarchical structures of systems. The following approaches are examined: (1) expert-based procedures, (2) hierarchical clustering; (3) spanning problems (e.g.,…

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in Puerto et al. (2011) that provides a unifying analysis of a wide class of hub location mod- els. In this paper, we deal with the capacitated…

This paper deals with an extension of the hub line location problem considering demand elasticity with respect to travel times. The proposed model aims to capture the impact the hub network topology has on demand. The objective is to…

The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…

Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. Hub facilities work as switching points for flows in large networks. In this study, we deal with a…

We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are…

The benefits of transmission line switching are well-known in terms of reducing operational cost and improving system reliability of power systems. However, finding the optimal power network configuration is a challenging task due to the…

In recent advances in solving the problem of transmission network expansion planning, the use of robust optimization techniques has been put forward, as an alternative to stochastic mathematical programming methods, to make the problem…

In this paper the capacitated hub location problem is formulated by a minimax regret model, which takes into account uncertain setup cost and demand. We focus on hub location with multiple allocations as a strategic problem requiring one…