netotz / alpha-neighbor-p-center-problem

Heuristic algorithms for the alpha-neighbor p-center problem.
MIT License
5 stars 0 forks source link

Implement faster data structures #11

Open netotz opened 2 years ago

netotz commented 2 years ago

Some operations could be done in less time by changing some of the data structures.

For example, instead of using an allocation matrix with users rows and facilities columns (in which each cell is the kth level of closeness), one of users rows and closeness columns (each cell being a facility) would allow to get the alpha-neighbors in O(1).