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

Insufficient number of friutless moves during IP local search #5

Open
SebastianSchlag opened this issue Oct 14, 2016 · 0 comments
Open
Assignees

Comments

@SebastianSchlag
Copy link
Member

If k is large, top-level coarsening is stopped early so that recursive bisection based IP can partition the hypergraph. The current # of friutless moves (50) might not be enough in this case. An adaptive variant would bei better in this case.

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

No branches or pull requests

2 participants