New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Test out whether traversing from demand to candidate is faster than all shortest paths #1

Open

fhk opened this issue Jun 23, 2019 · 0 comments

Owner

fhk commented Jun 23, 2019

One of the parts of the pre-compute that takes the most time is finding the potential assignments.

It might be faster to just traverse from the demand points to candidate hubs within range.

OR

Have a way to reduced the candidate over demand loop.

rewrite "make_assi_graph"

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment