Column generation Bin Packing heuristic based on CFT #4639
Merged
Conversation
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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 builds on top of #4628 and introduces a CFT-based Bin Packing heuristic example.
The approach starts with a small core Set Cover model using a limited number of initial columns. Then, during the subgradient procedure, new columns (bins for the BPP, subsets for the SCP) are dynamically generated and added to the model.
The implementation is still a bit rough, but due to time constraints, I’m submitting it as is, hoping it can still be useful to showcase one possible way to leverage the CFT framework for dynamic column generation.