Repository navigation
Conversation
zayenz
marked this pull request as ready for review
October 6, 2026 15:31
This branch has not been deployed
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
1 participant
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.
Add minimum-distance constraints over selected sites, with distances supplied by a validated matrix or a shared callable. Optional pair requirements set inclusive lower bounds on distances.
The default
MDP_SINGLEorganization caches pair maxima without allocating an actor for every pair.MDP_DECOMPOSEDprovides the alternative pairwise organization. Both support repeated sites and variable aliases; propagation is incomplete.IPL_BASICdisables the additional conflict-matching bound.The algorithms follow Lagerkvist's ModRef 2026 paper. The existing Gecode tests cover both organizations and distance representations, including cloning and callback lifetime.