نتایج جستجو برای: p median hub

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

2017
Mark S. Daskin

The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is NP-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem. Basic construction and improvement algorithms are outlined. Results from the lite...

Journal: :Research in Computing Science 2014

Journal: :Computers & OR 2009
Andreas T. Ernst Horst W. Hamacher Houyuan Jiang Mohan Krishnamoorthy Gerhard J. Woeginger

The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...

Journal: :European Journal of Operational Research 2007
Ann Melissa Campbell Timothy J. Lowe Li Zhang

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We esta...

The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...

Journal: :Journal of Combinatorial Optimization 2009

Journal: :Electr. J. Comb. 2000
Holger Glaab Alexander Pott

We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILP-formulation based on a new class of inequalities (subtour number constraints) is presented. The associated Hamiltonian p–median polytope is examined, in particular its dimension and its affine hull. We d...

Journal: :Environment and Planning B: Urban Analytics and City Science 2019

2017
Christian R. Mejia Mario J. Valladares-Garrido Armando Miñan-Tapia Felipe T. Serrano Liz E. Tobler-Gómez William Pereda-Castro Cynthia R. Mendoza-Flores Maria Y. Mundaca-Manay Danai Valladares-Garrido

INTRODUCTION Sci-Hub is a useful web portal for people working in science as it provides access to millions of free scientific articles. Satisfaction and usage should be explored in the Latino student population. The objective of this study was to evaluate the use, knowledge, and perception of the scientific contribution of Sci-Hub in medical students from Latin America. METHODOLOGY A multice...

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

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