A Julia package for operations research subjects
-
Updated
Aug 21, 2024 - Julia
A Julia package for operations research subjects
A collection of graph search algorithms including Dijkstra's shortest path algorithm, Multi-Threaded Dijkstra's (MTD) for solving median problem, and a clustering heuristic for p-median problem in Python.
Police vehicle allocation (P-median)
The P-Median Problem project uses metaheuristic optimization to solve the p-median location problem, with Jupyter notebooks implementing random sampling and local search algorithms to minimize service distances.
Add a description, image, and links to the p-median-problem topic page so that developers can more easily learn about it.
To associate your repository with the p-median-problem topic, visit your repo's landing page and select "manage topics."