[CutBranching] New wrapper for maximum independent set #8394
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
CutBranching_jll provides a julia wrapper for the CutBranching C++ solver for maximum independent set by Demian Hespe, Sebastian Lamm, and Christian Schorr
giordano
reviewed
Apr 1, 2024
There was a problem hiding this comment.
Again, for packages linking to libjulia follow existing examples: #8337 (review)
Co-authored-by: Mosè Giordano <giordano@users.noreply.github.com>
Co-authored-by: Mosè Giordano <giordano@users.noreply.github.com>
|
Thank you @giordano, I was updating the file while you were proposing new changes. I updated the file accordingly |
|
Hello @giordano, Is there any other review/comment that I should integrate before this can be scheduled for merge? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR creates a Julia wrapper for the CutBranching C++ package for the maximum independent set (Demian Hespe et al, Targeted Branching for the Maximum Independent Set Problem, 19th International Symposium on Experimental Algorithms (SEA 2021)). The upstream code is available at https://github.com/Hespian/CutBranching. Minor modifications (including a Julia connector) are included in my own fork of the code from which thir PR originates.