Skip to content
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.

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

Benchmark on DIMACS #25

Open
gatagat opened this issue Nov 15, 2020 · 0 comments
Open

Benchmark on DIMACS #25

gatagat opened this issue Nov 15, 2020 · 0 comments

Comments

@gatagat
Copy link
Owner

gatagat commented Nov 15, 2020

Benchmark on the matrices used in [1], the code necessary is available from the DIMACS challenge website [2] and the "picture" problem is straightforward to implemented.

[1] Goldberg & Kennedy, 1995: "An efficient cost scaling algorithm for the assignment problem". http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.2942
[2] http://archive.dimacs.rutgers.edu/pub/netflow/generators/network/assign.c / http://archive.dimacs.rutgers.edu/pub/netflow/generators/network/twocost.a / http://archive.dimacs.rutgers.edu/pub/netflow/generators/matching/dcube.c / http://archive.dimacs.rutgers.edu/pub/netflow/generators/network/geomasn.a

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant