Abstract This paper deals with an interesting facility location problem known as the bi-objective p -Median and -Dispersion ( BpMD problem). The seeks to locate facilities service a set of n demand points, goal is minimize total distance between points and, simultaneously, maximize minimum all pairs hosted facilities. addressed novel path relinking approach, called reactive relinking, which hyb...

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...

PURPOSE Prospectively identifying who will benefit from adjuvant chemotherapy (ACT) would improve clinical decisions for non-small cell lung cancer (NSCLC) patients. In this study, we aim to develop and validate a functional gene set that predicts the clinical benefits of ACT in NSCLC. EXPERIMENTAL DESIGN An 18-hub-gene prognosis signature was developed through a systems biology approach, and...

Understanding the genetic architecture of polygenic traits requires investigating how complex networks of interacting molecules mediate the effect of genetic variation on organismal phenotypes. We used a combination of P-element mutagenesis and analysis of natural variation in gene expression to predict transcriptional networks that underlie alcohol sensitivity in Drosophila melanogaster. We id...

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...

The p-median offers an alternative to centroid-based clustering algorithms for identifying unobserved categories. However, existing p-median formulations typically require data aggregation into a single proximity matrix, resulting in masked respondent heterogeneity. A proposed three-way formulation of the p-median problem explicitly considers heterogeneity by identifying groups of individual re...

Authors investigate the p-median location problem on networks and propose a heuristic algorithm which is based on the probability changing method (a special case of the genetic algorithm) for an approximate solution to the problem. The ideas of the algorithm are proposed under the assumption that, in the largescale networks with comparatively small edge lengths, the p-median problem has feature...

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...

Abstract Location-Routing problems involve locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. A special case of these problems is Hamiltonian p Median Problem (HpMP). In attempting to solve this problem, numerous mathematical formulations have been proposed. Most of them have in common t...

By means of a model based on a set covering formulation, it is shown how the p-Median Problem can be solved with just a column generation approach, which is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances which have been optimally solved. In particular, problems of siz...