feat: Adding lower-bounding search to the solver #132
Merged
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
EmirDe
reviewed
Jan 21, 2025
|
This should be refactored into separate structures and removed from the "Solver" api; this would lead to more separable logical structures with the added benefit of improved extendability |
ImkoMarijnissen
commented
Feb 3, 2025
ImkoMarijnissen
commented
Feb 3, 2025
pumpkin-solver/src/optimisation_search/lower_bounding_search.rs
Outdated
Show resolved
Hide resolved
ImkoMarijnissen
commented
Feb 3, 2025
ImkoMarijnissen
commented
Feb 3, 2025
ImkoMarijnissen
commented
Feb 3, 2025
maartenflippo
previously requested changes
Feb 3, 2025
github-actions
bot
dismissed
maartenflippo’s stale review
Review re-requested
maartenflippo
approved these changes
Feb 10, 2025
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.
Currently, we only support upper-bounding search (LSU) in the solver; however, it makes sense to also support lower-bounding search (LUS) in the solver.
This PR aims to implement lower-bounding search using assumptions.