Results 201 to 210 of about 71,717 (241)
Some of the next articles are maybe not open access.
New complexity results for the p-hub median problem
Annals of Operations Research, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
European Journal of Operational Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernst, Andreas T., Krishnamoorthy, Mohan
openaire +3 more sources
International Congress on Human-Computer Interaction, Optimization and Robotic Applications Proceedings, 2019
[Abtsract Not Available]
Yıldırım, Betül +3 more
openaire +2 more sources
[Abtsract Not Available]
Yıldırım, Betül +3 more
openaire +2 more sources
Using simulated annealing to solve the p‐Hub Median Problem
International Journal of Physical Distribution & Logistics Management, 2001Locating hub facilities is important in different types of transportation and communication networks. The p‐Hub Median Problem (p‐HMP) addresses a class of hub location problems in which all hubs are interconnected and each non‐hub node is assigned to a single hub. The hubs are uncapacitated, and their number p is initially determined.
openaire +1 more source
A new modelling for p-hub median problem by considering flow-dependent costs
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013The p-hub median problem is to determine a number of p hubs and allocate the remaining non-hub nodes to them such that total cost of the network is minimized. Normally, this cost is considered as a linear function of distance between nodes. However, such assumption results in a naive modeling of the hub networks of the real world.
Masoud Rabbani +2 more
openaire +1 more source
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem
Optimization Letters, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Hub Location and the p-Hub Median Problem
Operations Research, 1996Hub facilities serve as switching and transshipment points in transportation and communication networks. Hub networks concentrate flows on the hub-to-hub links and benefit from economies of scale in interhub transportation. Most hub location research has focused on problems where each origin/destination is allocated to a single hub.
openaire +2 more sources
European Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilić, Aleksandar +3 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilić, Aleksandar +3 more
openaire +1 more source
A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem
2005The p – hub median problem is an NP hard location – allocation problem, that consists of finding p points to establish facilities and the assignment of the users to these points. In the capacitated version of this problem, each hub has got a maximum capacity limiting the traffic to be assigned.
Melquíades Pérez +2 more
openaire +1 more source
Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem
2007Scalability constitutes a key property in Peer-to-Peer environments. One way to foster this property is the introduction of superpeers, a concept which has gained widespread acceptance in recent years. However, the problem of finding the set of super-peers that minimizes the total communication cost is NP-hard.
Steffen Wolf, Peter Merz
openaire +1 more source