Data Structures and Algorithms

Solving Hub Location Problems for Networks

This work developed a heuristic algorithm to find a solution for the CSAHLP problem. Two formulations were proved CSAHLP-C y CSAHLP-N. For the CSAHLP-C only three size of nodes were proved: 10, 20 and 25 nodes. For problems with more nodes the Cpu-time was very large. For the CSAHLP-N six size of nodes were proved: 10, 20, 25, 40, 50 and 100 nodes. The Cpu-time found are interesting and the gaps are few in the most of cases.

Submission history

Add your own feedback and questions here:You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.